default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 7
Volume 7, April 2001
- Jayme Luiz Szwarcfiter:
Preface: Volume 7. 1 - Miguel A. Pizaña:
Distances and Diameters on Iterated Clique Graphs. 2-5 - Eduardo Sany Laber, Leonardo Gomes Holanda:
On asymmetric communication protocols. 6-9 - Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Clique Divergent Clockwork Graphs and Partial Orders. 10-13 - Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Stable marriages with restricted pairs. 14-17 - Luérbio Faria, Celina M. H. de Figueiredo
, Candido Ferreira Xavier de Mendonça Neto:
On the complexity of the approximation of nonplanarity parameters for cubic graphs. 18-21 - Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. 22-25 - Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
Bilateral Orientations and Domination. 26-29 - Zhicheng Gao, Jianyu Wang:
Exact Enumeration of Rooted 3-connected Triangular Maps on the Projective Plane (Extended Abstract). 30-33 - Lauro Lins, Sóstenes Lins, Silvio Melo:
Symmetry Robust Memory Management of Multidimensional Arrays. 34-37 - Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi:
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid. 38-41 - Andreas Baltz, Tomasz Schoen, Anand Srivastav:
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). 42-45 - Antonio Fernández, Tom Leighton, José Luis López-Presa:
Containment Properties of Product and Power Graphs. 46-49 - Jesper Jansson:
On the Complexity of Inferring Rooted Evolutionary Trees. 50-53 - Vince Grolmusz:
Constructive Upper Bounds for Intersecting Set Systems. 54-57 - Vlady Ravelomanana, Loÿs Thimonier:
Asymptotic enumeration of cographs. 58-61 - Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa:
Bounds for Optimal Coverings. 62-65 - Claudio T. Bornstein, Andre Silva Ribeiro, Abilio Lucena:
Maximum flow problems under special nonnegative lower bounds on arc flows. 66-69 - Abilio Lucena, Mauricio G. C. Resende:
Generating lower bounds for the prize collecting Steiner problem in graphs. 70-73 - Jeong Han Kim:
Nearly Optimal Partial Steiner Systems. 74-77 - Benjamin Doerr, Anand Srivastav:
Multi-Color Discrepancies - Extended Abstract -. 78-81 - Jaime Cohen:
A Graph Partitioning Scheme and Applications to Fault Tolerant Computing. 82-85 - David Pokrass Jacobs, Catia Maria dos Santos Machado, Vilmar Trevisan:
An O(n2) Algorithm for the Characteristic Polynomial of a Tree. 86-89 - Eduardo Sany Laber, Loana Tito Nogueira:
Fast Searching in Trees. 90-93 - Marisa Gutierrez, Joao Meidanis:
The Clique Operator, Set Families, and Their Properties. 94-97 - Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On generalized split graphs. 98-101 - Manoel B. Campêlo, Claudio T. Bornstein:
Add/Drop Procedures for the Capacitated Plant Location Problem. 102-105 - Toru Hasunuma:
Independent spanning cycle-rooted trees in the cartesian product of digraphs. 106-109 - Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. 110-113 - Candida Nunes da Silva, Ricardo Dahab:
Tutte's 3-flow Conjecture and Matchings in Bipartite Graphs. 114-117 - Bartolomeu F. Uchôa Filho, Cecilio Pimentel:
Enumerative Combinatorics and Shannon's Theory of Discrete Noiseless Channels. 118-121 - Felipe Martins Müller, Mauro Marafiga Camozzato, Olinto César Bassi de Araújo:
Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem. 122-125 - Liliana Alcón, Marisa Gutierrez:
Clique Planar Graphs. 126-129 - Lucia Draque Penso, Valmir Carneiro Barbosa:
A distributed algorithm for k-dominating sets. 130-133 - Milind Dawande, Subodha Kumar, Chelliah Sriskandarajah:
Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms. 134-137 - Asla Medeiros Sá, Paulo Cezar Pinto Carvalho:
Color quantization by pairwise clustering using a reduced graph. 138-141 - Luciene C. S. Motta, Luiz Satoru Ochi, Carlos A. J. Martinhon:
Reduction Rules for the Covering Tour Problem. 142-145 - Patricio V. Poblete, Alfredo Viola:
The effect of deletions on different insertion disciplines for hash tables (Extended Abstract). 146-149 - Marcus Poggi de Aragão, Eduardo Uchoa, Renato Fonseca F. Werneck:
Dual Heuristics on the Exact Solution of Large Steiner Problems. 150-153 - Milind Dawande, Jayant Kalagnanam, Jay Sethuraman:
Variable Sized Bin Packing With Color Constraints. 154-157 - Said Sadique Adi, Carlos Eduardo Ferreira:
DNA Fragments Assembly Programs: a comparative study. 158-161 - Juliano Palmieri Lage, Renato M. Assunção, Edna Afonso Reis:
A Minimal Spanning Tree Algorithm Applied to Spatial Cluster Analysis. 162-165 - Manoel B. Campêlo, Ricardo C. Corrêa, Nelson Maculan, Fábio Protti:
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors. 166-169 - Van H. Vu:
Some recent results on list coloring. 170-173 - J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
A sufficient condition for self-clique graphs. 174-177 - Isabel Méndez-Díaz, Paula Zabala:
A Polyhedral Approach for Graph Coloring1. 178-181 - A. Goldman, Christophe Rapine:
Scheduling with Duplication on m Processors with Small Communication Delays. 182-185 - Rudini Menezes Sampaio, Cláudia Linhares Sales:
On the complexity of finding even pairs in planar perfect graphs. 186-189 - Ryan B. Hayward, William J. Lenhart:
Perfectly Orderable P4 Composition. 190-193 - Gruia Calinescu, Cristina G. Fernandes:
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. 194-197 - Mario Valencia-Pabon:
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs. 198-201 - Stéphan Ceroi, Frédéric Havet:
Trees with three leaves are (n + l)-unavoidable. 202-205
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 2025-12-09 23:27 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:
