default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 35
Volume 35, December 2009
- Thomas M. Liebling, Jayme Luiz Szwarcfiter, Carlos Eduardo Ferreira, Fábio Protti
:
Preface. 1-2 - Benjamin Lévêque, Dominique de Werra:
Graph transformations preserving the stability number. 3-8 - Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo:
Skew partition sandwich problem is NP-complete. 9-14 - José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
On the Metric Dimension of Infinite Graphs. 15-20 - Júlio César Silva Araújo, Cláudia Linhares Sales:
Grundy number on P4-classes. 21-27 - Ricardo Gómez Aiza, Juan José Montellano-Ballesteros, Ricardo Strausz, Kolja B. Knauer:
Polynomial Time Recognition of Uniform Cocircuit Graphs. 29-34 - Mónica Braga, Javier Marenco:
A polyhedral study of the acyclic coloring problem. 35-40 - Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
On minimal forbidden subgraph characterizations of balanced graphs. 41-46 - Gordana Manic, Laura Bahiense, Cid C. de Souza:
A branch&cut algorithm for the maximum common edge subgraph problem. 47-52 - Arnaud Pêcher, Annegret Katrin Wagler:
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. 53-58 - Madiagne Diallo, Serigne Gueye, Pascal Berthomé:
Impact of a varying capacity on the all pairs 2-route network flows. 59-64 - Oscar Rojo, Luis Medina, Nair Abreu, Cláudia Marcela Justel:
Maximizing the algebraic connectivity for a subclass of caterpillars. 65-70 - Vagner Pedrotti, Célia Picinin de Mello:
Minimal separators in P4-tidy graphs. 71-76 - Emerson L. Monte Carmelo:
Invariant sets under permutation, extremal graphs, and covering codes. 77-82 - Luidi Simonetti, Yuri Frota, Cid C. de Souza:
Upper and lower bounding procedures for the minimum caterpillar spanning problem. 83-88 - Manoel B. Campêlo, Gérard Cornuéjols:
The Chvátal closure of generalized stable sets in bidirected graphs. 89-95 - Rudolf Grübel, Pawel Hitczenko:
Gaps in discrete random samples: extended abstract. 97-102 - Edna Ayako Hoshino, Cid Carvalho de Souza:
A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem. 103-108 - Silvia M. Bianchi, M. S. Montelar, Mariana S. Escalante:
Strength of facets for the set covering and set packing polyhedra on circulant matrices. 109-114 - Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Properties of an Approximability-related Parameter on Circular Complete Graphs. 115-120 - Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei:
On the dominating set polytope of web graphs. 121-126 - Pablo De Caria, Marisa Gutierrez:
Minimal vertex separators and new characterizations for dually chordal graphs. 127-132 - Cristiano Arbex Valle, Alexandre Salles da Cunha, Geraldo Robson Mateus, Leonardo C. Martinez:
Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized. 133-138 - Carla Bechelane, Alexandre Salles da Cunha, Geraldo Robson Mateus:
The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks. 139-144 - Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi:
On the Pfaffian Number of Graphs. 145-150 - Flávio Keidi Miyazawa, André Luís Vignatti:
Convergence Time to Nash Equilibrium in Selfish Bin Packing. 151-156 - Hiêp Hàn, Yury Person, Mathias Schacht:
Note on strong refutation algorithms for random k-SAT formulas. 157-162 - Frederico R. B. Cruz:
Optimizing the throughput, service rate, and buffer allocation in finite queueing networks. 163-168 - Sidi Mohamed Sedjelmaci:
The Mixed Binary Euclid Algorithm. 169-176 - Satish Varagani, V. Ch. Venkaiah, Kishore Yadav, Kishore Kothapalli:
Acyclic Vertex Coloring of Graphs of Maximum Degree Six. 177-182 - Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
A note on permutation regularity. 183-188 - Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. 189-195 - Flavia Bonomo, Javier Marenco, Daniela Sabán, Nicolás Stier Moses:
A polyhedral study of the maximum edge subgraph problem. 197-202 - Maria Aguieiras A. de Freitas, Renata R. Del-Vecchio, Nair Maria Maia de Abreu, Steve Kirkland:
On Q-spectral integral variation. 203-208 - Cláudia Linhares Sales, Leonardo Sampaio Rocha:
b-coloring of m-tight graphs. 209-214 - Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. 215-220 - Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti:
On s-t paths and trails in edge-colored graphs. 221-226 - Gabriele Di Stefano:
Distance-Hereditary Comparability Graphs. 227-233 - Takehiro Ito, W. Sean Kennedy, Bruce A. Reed:
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. 235-240 - Marina Groshaus, Leandro Pedro Montero:
The number of convergent graphs under the biclique operator with no twin vertices is finite. 241-246 - Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Short Models for Unit Interval Graphs. 247-255 - Telma Pará, Sylvain Gravier, Simone Dantas:
Impartial Solitaire Clobber played on Powers of Paths. 257-262 - Hammurabi Mendes, Cristina G. Fernandes:
A Concurrent Implementation of Skip Graphs. 263-268 - Ana Paulina Figueroa, Eduardo Rivera-Campo:
On the basis graph of a bicolored matroid. 269-273 - Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet:
Good edge-labelling of graphs. 275-280 - Victor A. Campos, Cláudia Linhares Sales, Frédéric Maffray, Ana Silva:
b-chromatic number of cacti. 281-286 - Márcia R. Cerioli, André L. Korenchendler:
Clique-Coloring Circular-Arc Graphs. 287-292 - Flavia Bonomo, Mario Valencia-Pabon:
Minimum Sum Coloring of P4-sparse graphs. 293-298 - Márcia R. Cerioli, Daniel F. D. Posner:
On lambda-coloring split, chordal bipartite and weakly chordal graphs. 299-304 - Olivier Roussel, Michèle Soria:
Boltzmann sampling of ordered structures. 305-310 - Babak Farzad, Dirk Oliver Theis:
The chromatic number of random lifts of K5 e. 311-316 - Martin Milanic, Jérôme Monnot:
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. 317-322 - Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti:
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals. 323-328 - Martín Matamala, José Zamora:
Degree Sequence of Tight Distance Graphs. 329-334 - Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz:
Almost spanning subgraphs of random graphs after adversarial edge removal. 335-340 - Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
On the clique behavior of circulants with three small jumps. 341-346 - Laura Bahiense, Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro:
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives. 347-352 - N. R. Aravind, C. R. Subramanian:
Intersection Dimension and Maximum Degree. 353-358 - Carlos Cardonha, Ralf Borndörfer:
A Set Partitioning Approach to Shunting. 359-364
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-04-01 00:21 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:
