default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 19
Volume 19, June 2005
- Paulo Feofiloff
, Celina M. H. de Figueiredo, Yoshiko Wakabayashi:
Preface. 1-7 - Arnaud Pêcher, Annegret Wagler, Xuding Zhu:
Three classes of minimal circular-imperfect graphs. 9-15 - Roberto Cruz:
Upper bound on the non-colorability threshold of the 2+p-COL problem. 17-23 - José Cáceres, María Luz Puertas, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
Searching for geodetic boundary vertex sets. 25-31 - Guilherme P. Telles, João Meidanis:
Building PQR trees in almost-linear time. 33-39 - Eraldo L. R. Fernandes, Celso C. Ribeiro:
A multistart constructive heuristic for sequencing by hybridization using adaptive memory. 41-47 - Marc Demange, Tínaz Ekim, Dominique de Werra:
(p, k)-coloring problems in line graphs. 49-55 - Zoltán Szigeti:
On the local splitting theorem. 57-61 - Javier Marenco, Annegret Wagler:
The combinatorial stages of chromatic scheduling polytopes. 63-69 - Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
The Helly property on subhypergraphs. 71-77 - Jirí Fiala, Jan Kratochvíl, Attila Pór:
On the computational complexity of partial covers of Theta graphs. 79-85 - Rodrigo S. C. Leão, Valmir Carneiro Barbosa:
Generating all the cubic graphs that have a 6-cycle double cover. 87-93 - Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs. 95-101 - Mourad Baïou, José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation. 103-109 - Pierre Hansen, Dragan Stevanovic:
On bags and bugs. 111-116 - Flavia Bonomo, Mariano Cecowski Palacio:
Between coloring and list-coloring: mu-coloring. 117-123 - Joe Sawada:
A Gray code for binary subtraction. 125-131 - Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song:
An all-substrings common subsequence algorithm. 133-139 - Claudson F. Bornstein, Eduardo Sany Laber, Marcelo Albuquerque Fernandes Más:
Randomized mechanisms for limited supply multi-item auctions. 141-147 - Manoel Lemos, T. R. B. Melo:
Non-separating cocircuits in matroids. 149-153 - L. Sunil Chandran, Naveen Sivadasan:
On the Hadwiger number of hypercubes and its generalizations. 155-161 - Alois Panholzer:
The distribution of the path edge-covering numbers for random trees. 163-169 - Rahul Muthu, N. Narayanan, C. R. Subramanian:
Improved bounds on acyclic edge colouring. 171-177 - Mathias Schacht, Anusch Taraz:
Globally bounded local edge colourings of hypergraphs. 179-185 - Murali K. Ganapathy, Sachin Lodha:
Search locally to arrange cyclically. 187-193 - Gerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng:
Probe interval bigraphs. 195-201 - Vince Grolmusz:
On some applications of randomized memory. 203-209 - Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi:
A general approach to L(h, k)-label interconnection networks. 211-217 - Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
Lehman's equation on near-ideal clutters. 219-224 - Richard M. Karp, Till Nierhoff, Till Tantau:
Optimal flow distribution among multiple channels with unknown capacities. 225-231 - Dominique Barth, Pascal Berthomé, Madiagne Diallo:
Detecting flows congesting a target network link. 233-239 - Sylvia C. Boyd, Paul Elliott-Magwood:
Computing the integrality gap of the asymmetric travelling salesman problem. 241-247 - Aaron Michael Williams, Bertrand Guenin:
Advances in packing directed joins. 249-255 - Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed:
Degree constrained subgraphs. 257-263 - Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. 265-271 - Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster algorithms for feedback vertex set. 273-279 - Silvia B. Tondato, Marisa Gutierrez, Jayme Luiz Szwarcfiter:
A forbidden subgraph characterization of path graphs. 281-287 - Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis:
Non loop graphs with induced cycles. 289-295 - Conor Meagher, Bruce A. Reed:
Fractionally total colouring Gn, p. 297-303 - Márcia R. Cerioli, Priscila Petito:
Forbidden subgraph characterization of split graphs that are UEH. 305-311 - Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Two- and three-dimensional parametric packing. 313-319 - Mihalis Beis, William Duckworth, Michele Zito:
Large k-independent sets of regular graphs. 321-327 - E. C. Xavier, Flávio Keidi Miyazawa:
A one-dimensional bin packing problem with shelf divisions. 329-335 - Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa:
On the asymmetric representatives formulation for the vertex coloring problem. 337-343 - Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Local cutpoints and iterated clique graphs. 345-349 - Francisco Larrión, Miguel A. Pizaña:
On hereditary Helly self-clique graphs. 351-356 - Martín Matamala, José Zamora:
A new family of K-divergent graphs. 357-363 - Carlos Eduardo Rodrigues Alves, Alair Pereira do Lago, Augusto F. Vellozo:
Alignment with non-overlapping inversions in O(n3logn)-time. 365-371 - Mateus de Oliveira Oliveira, Fabíola Greve:
A new refinement procedure for graph isomorphism algorithms. 373-379 - Walter F. Mascarenhas:
Two aspects of the pallet loading problem. 381-387 - Alexandre Pigatti, Marcus Poggi de Aragão, Eduardo Uchoa:
Stabilized branch-and-cut-and-price for the generalized assignment problem. 389-395 - Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan:
The 3-colored Ramsey number of odd cycles. 397-402 - Alexandre Salles da Cunha, Abilio Lucena:
Algorithms for the degree-constrained minimum spanning tree problem. 403-409 - Murilo Vicente Gonçalves da Silva, André Luiz Pires Guedes:
Perfect subgraph/supergraph. 411-416
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-12-26 00:37 CET 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:
