Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 13
Volume 13, Number 1, 2011
- Sylwia Cichacz, Jakub Przybylo:
Irregular edge coloring of 2-regular graphs. 1-12 - Alexander Grigoriev
:
Tree-width and large grid minors in planar graphs. 13-20
- Nicholas A. Loehr, Elizabeth M. Niese:
Recursions and divisibility properties for combinatorial Macdonald polynomials. 21-44
- Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. 45-66
- Ehsan Chiniforooshan, Vasek Chvátal:
A de Bruijn - Erdős theorem and metric spaces. 67-74
- Christiane Frougny, Anna Chiara Lai:
Negative bases and automata. 75-94
- Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. 95-112
Volume 13, Number 2, 2011
- Yury Person, Mathias Schacht:
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. 1-18 - Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl:
Parameterized Problems Related to Seidel's Switching. 19-44 - Damien Pitman:
Random 2-SAT Solution Components and a Fitness Landscape. 45-62
- Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
Generation of Cubic graphs. 69-80 - Alewyn P. Burger, Jan H. van Vuuren:
Avoidance colourings for small nonclassical Ramsey numbers. 81-96
- Anita Das:
A Combinatorial Approach to Tanny Sequence. 97-108
- David R. Wood:
Colouring the Square of the Cartesian Product of Trees. 109-112
Volume 13, Number 3, 2011
- Helmut Prodinger:
Digital search trees with m trees: Level polynomials and insertion costs. 1-8
- Xin Zhang, Jianliang Wu, Guizhen Liu:
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. 9-16
- David R. Wood:
On the number of maximal independent sets in a graph. 17-20
- Ramin Kazemi, Mohammad Q. Vahidi-Asl:
The Variance of The Profile in Digital Search Trees. 21-38 - David R. Wood, Vida Dujmovic:
On the Book Thickness of k-Trees. 39-44 - Andrzej Dudek, David Wajc:
On the complexity of vertex-coloring edge-weightings. 45-50
- Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová:
On the number of factors in codings of three interval exchange. 51-66
- Monika Pilsniak, Mariusz Wozniak:
On packing of two copies of a hypergraph. 67-74
- Yidong Sun, Yanjie Xu:
The largest singletons in weighted set partitions and its applications. 75-86
- Michael A. Henning, Ernst J. Joubert, Justin Southey:
Nordhaus-Gaddum Type Results for Total Domination. 87-96
- Min Chen, André Raspaud, Weifan Wang:
8-star-choosability of a graph with maximum average degree less than 3. 97-110
Volume 13, Number 4, 2011
- Ákos Seress, Mario Szegedy:
Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday. 1-4 - Nurullah Ankaralioglu, Ákos Seress:
Computing tensor decompositions of finite matrix groups. 5-14 - Thomas P. Hayes:
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. 15-22 - Gábor Horváth, Csaba A. Szabó:
The extended equivalence and equation solvability problems for groups. 23-32 - Péter Pál Pach, Csaba A. Szabó:
On the minimal distance of a polynomial code. 33-44 - Delaram Kahrobaei, Stephen Majewicz:
On the residual solvability of generalized free products of solvable groups. 45-50 - Sourav Chakraborty:
On the sensitivity of cyclically-invariant Boolean functions. 51-60 - Eugene M. Luks, Takunari Miyazaki:
Polynomial-time normalizers. 61-96 - Robert F. Bailey, Karen Meagher:
On the metric dimension of Grassmann graphs. 97-104
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
