Electronic Notes in Discrete Mathematics, Volume 7

Volume 7, April 2001

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