Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 44
Volume 44, November 2013
- Jesús A. De Loera, Thomas M. Liebling, Miguel A. Pizaña, Gelasio Salazar:
Preface. 1-2 - Vítor Costa, Simone Dantas, Dieter Rautenbach:
Matchings in Graphs of Odd Regularity and Girth. 3-8 - Carlos Vinícius G. C. Lima
, Nicolas Almeida Martins, Leonardo Sampaio Rocha, Marcio Costa Santos, Ana Silva:
b-chromatic index of graphs. 9-14 - Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle transversals in distance-hereditary graphs. 15-21 - Gérard D. Cohen, Emanuela Fachini, János Körner:
More on Connector Families. 23-29 - Tiziana Calamoneri, Rossella Petreschi:
Graphs with Dilworth Number Two are Pairwise Compatibility Graphs. 31-38 - Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira:
The generalized split probe problem. 39-45 - Marisa Gutierrez, Silvia B. Tondato:
Special asteroidal quadruple on directed path graph non rooted path graph. 47-52 - Deepan Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost Empty Monochromatic Triangles in Planar Point Sets. 53-59 - Ramon Lopes, Vitor A. A. Souza, Alexandre Salles da Cunha:
A Branch-and-price Algorithm for the Multi-Vehicle Covering Tour Problem. 61-66 - Júlio Araújo, Grégory Morel, Leonardo Sampaio Rocha, R. Soares, Valentin Weber:
Hull number: P5-free graphs and reduction rules. 67-73 - Mathew C. Francis, Pavol Hell, Juraj Stacho:
Obstructions to chordal circular-arc graphs of small independence number. 75-81 - Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
A New Formulation and Computational Results for the Simple Cycle Problem. 83-88 - Xi Sisi Shen, Aaron Williams:
A 'Hot Potato' Gray Code for Permutations. 89-94 - Henning Bruhn, Maya Stein:
Small degree vertices in minimal bricks. 95-100 - Andrea Jiménez:
Small degeneracy of antiferromagnetic triangulations. 101-108 - Rafael T. Araújo, Rudini Menezes Sampaio, Jayme Luiz Szwarcfiter:
The convexity of induced paths of order three. 109-114 - Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
On minimal non [h, 2, 1] graphs. 115-120 - Amanda Montejano, Jorge L. Arocha:
Null and non-rainbow colorings of maximal planar graphs. 121-126 - Leonardo Martínez-Sandoval, Luis Montejano:
Geometric variants of Hall's Theorem through Sperner's Lemma. 127-132 - Adrián Vázquez-Ávila, Gabriela Araujo-Pardo, Amanda Montejano, Luis Montejano:
The transversal numbers of linear systems with given 2-packing numbers. 133-139 - Nicolas Nisse, Ronan Pardo Soares:
On the Monotonicity of Process Number. 141-147 - M. Gisela Bardossy, S. Raghavan:
Robust Optimization for the Connected Facility Location Problem. 149-154 - Deborah Oliveros-Braniff, Natalia Garcia-Colin, Amanda Montejano, Luis Montejano:
Searching for perfection on hypergraphs. 155-161 - Gabriela Araujo-Pardo, Christian Rubio-Montiel:
The ωψ-perfection of graphs. 163-168 - Andres J. Ruiz-Vargas:
Empty triangles in complete topological graphs. 169-174 - Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
Polyhedra associated with identifying codes. 175-180 - Oswin Aichholzer, Jorge Urrutia, Birgit Vogtenhuber:
Balanced 6-holes in linearly separable bichromatic point sets. 181-186 - Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada:
On k-critical P5-free graphs. 187-193 - Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs. 195-200 - Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
Models and Algorithms for Carsharing Systems and Related Problems. 201-206 - Rommel M. Barbosa, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
On Minimal and Minimum Hull Sets. 207-212 - Filip Moric, János Pach:
On Schur's conjecture. 213-218 - Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
{k}-domination for chordal graphs and related graph classes. 219-224 - Sarah Miracle, Dana Randall:
Algorithms to Approximately Count and Sample Conforming Colorings of Graphs. 225-231 - Manoel B. Campêlo, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi:
Polyhedral studies on the convex recoloring problem. 233-238 - Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos:
On the representatives k-fold coloring polytope. 239-244 - Pablo Mayckon Silva Farias, Ricardo C. Corrêa:
Linear time computation of the maximal sums of insertions into all positions of a sequence. 245-250 - Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes:
Arc-based integer programming formulations for three variants of proportional symbol maps. 251-256 - Marthe Bonamy, Nicolas Bousquet:
Recoloring bounded treewidth graphs. 257-262 - Pablo Daniel Torres, Mario Valencia-Pabon:
On the packing chromatic number of hypercubes. 263-268 - Gabriela R. Argiroffo, Mariana S. Escalante, Maria E. Ugarte:
The 2-dominating set polytope of cycles and related graph classes. 269-274 - Hidefumi Hiraishi, Sonoko Moriyama:
A new infinite family of minimal non-orientable matroids of rank 3 with 3n elements. 275-280 - Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
An exact DSatur-based algorithm for the Equitable Coloring Problem. 281-286 - Pablo De Caria, Marisa Gutierrez:
Introducing subclasses of basic chordal graphs. 287-292 - Boris Albar, Daniel Gonçalves:
Too many triangles. 293-297 - Cândida Nunes da Silva, Lissa Pesci, Claudio L. Lucchesi:
Snarks and Flow-Critical Graphs. 299-305 - M. Sohel Rahman, M. Kaykobad, Md. Tanvir Kaykobad:
Bipartite Graphs, Hamiltonicity and Z graphs. 307-312 - Andreas Bley, Mohsen Rezapour:
Approximating connected facility location with buy-at-bulk edge costs via random sampling. 313-319 - Rudolf Grübel, Pawel Hitczenko:
Pruned discrete random samples. 321-326 - Silvia M. Bianchi, Mariana S. Escalante, M. Susana Montelar:
A note on the disjunctive index of joined a-perfect graphs. 327-332 - Kaio Karam, C. N. Campos:
Fulkerson's Conjecture and Loupekine snarks. 333-338 - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. 339-344 - Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. 345-350 - Christoph Dürr, Flavio Guiñez:
The Wide Partition Conjecture and the Atom Problem in Discrete Tomography. 351-356 - Aaron Williams, Joe Sawada:
Greedy Pancake Flipping. 357-362 - Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
Edge Intersection Graphs of L-Shaped Paths in Grids. 363-369 - Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
Polynomial time algorithm for the Radon number of grids in the geodetic convexity. 371-376 - Paola B. Tolomei, Luis Miguel Torres:
On the first Chvátal closure of the set covering polyhedron related to circulant matrices. 377-383 - Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht:
Extremal results for odd cycles in sparse pseudorandom graphs. 385-391 - Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
An approximate blow-up lemma for sparse pseudorandom graphs. 393-398 - Guillermo Durán:
Forbidden induced subgraph characterizations of subclasses and variations of perfect graphs: A survey. 399-404 - Luis Montejano:
A Non-expensive Homological Helly Theorem. 405-409 - Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
More on the crossing number of Kn: Monotone drawings. 411-414
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-19 20:11 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:
