Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 37
Volume 37, August 2011
- Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. 1-2 - Yoshiharu Kohayakawa
, Guilherme Oliveira Mota, Roberto F. Parente:
A note on counting orientations. 3-8 - Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon:
Finding an induced subdivision of a digraph. 9-14 - Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Jorge Amaya:
Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty. 15-20 - Fabián Riquelme, Andreas Polyméris:
On the Complexity of the Decisive Problem in Simple and Weighted Games. 21-26 - Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza:
New branch-and-bound algorithms for k-cardinality tree problems. 27-32 - Pablo De Caria, Marisa Gutierrez:
Comparing trees characteristic to chordal and dually chordal graphs. 33-38 - Pablo De Caria:
The difference between clique graphs and iterated clique graphs. 39-44 - Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo:
On Coloring Problems of Snark Families. 45-50 - Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
A note on random k-dimensional posets. 51-56 - Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Restricted coloring problems on graphs with few P'4s. 57-62 - Nicolas Lermé, Lucas Létocart, François Malgouyres:
Reduced graphs for min-cut/max-flow approaches in image segmentation. 63-68 - Pablo Adasme, Abdel Lisser, Ismael Soto:
A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks. 69-74 - José A. Soto:
A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids. 75-80 - Liliana Alcón:
Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs. 81-86 - Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul:
Contracting chordal graphs and bipartite graphs to paths and trees. 87-92 - J. Andrés Montoya, Francisco Gutierrez, Luis E. Zambrano:
Some Applications of the Schutzenberger-Bertoni Method. 93-98 - Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa:
Two Dimensional Strip Packing with Unloading Constraints. 99-104 - Gordana Manic, Daniel M. Martin, Milos Stojakovic:
Bichromatic Triangle Games. 105-110 - Giuseppe Lancia, Paolo Serafini:
An effective compact formulation of the max cut problem on sparse graphs. 111-116 - Takashi Yamada, Takayoshi Shoudai:
Efficient Pattern Matching on Graph Patterns of Bounded Treewidth. 117-122 - Pascal Ochem, Alexandre Pinlou:
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. 123-128 - Maya Stein, José Zamora:
The relative degree and large complete minors in infinite graphs. 129-134 - Sidi Mohamed Sedjelmaci:
Some Related Functions to Integer GCD and Coprimality. 135-140 - Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
String graphs of k-bend paths on a grid. 141-146 - Carlos Eduardo Ferreira, Alexandre S. Freire, G. A. Puglia:
A dynamic programming algorithm for the tree mapping problem. 147-152 - Oscar Rojo, Israel Rocha, Vilmar Trevisan:
Algebraic connectivity on a subclass of caterpillars. 153-158 - Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
Polyhedral results for the Equitable Coloring Problem. 159-164 - Karla Roberta Lima, Yoshiko Wakabayashi:
Convex Recoloring of Paths. 165-170 - Luciano L. Silveira, Marcelo Henriques de Carvalho:
Ear decompositions of join covered graphs. 171-176 - Telma Pará, Simone Dantas, Sylvain Gravier:
Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber. 177-182 - Álinson S. Xavier, Manoel B. Campêlo:
A New Facet Generating Procedure for the Stable Set Polytope. 183-188 - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. 189-194 - Sebastián Urrutia, Abilio Lucena:
A New Formulation for Spanning Trees. 195-200 - Néstor E. Aguilera, Mariana S. Escalante, Pablo G. Fekete:
On the facets of the lift-and-project relaxations of graph subdivisions. 201-206 - Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. 207-212 - Mónica Braga, Javier Marenco:
Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope. 213-218 - George B. Mertzios, Ivona Bezáková:
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time. 219-224 - Andrea Jiménez, Marcos A. Kiwi:
Counting perfect matchings in the geometric dual. 225-230 - Javier Marenco, Tomás Tetzlaff:
Envy-free division of discrete cakes. 231-236 - Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota:
On an anti-Ramsey property of random graphs. 237-242 - Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Mouny Samy Modeliar:
Efficient Constraint Propagation for Graph Coloring. 243-248 - Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha:
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking. 249-254 - Edna Ayako Hoshino:
The minimum cut cover problem. 255-260 - Mariana S. Escalante, Javier L. Marenco, María del Carmen Varaldo:
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs. 261-266 - Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa:
Two Dimensional Knapsack with Unloading Constraints. 267-272 - Hernán Berinsky, Paula Zabala:
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem. 273-278 - Diego Delle Donne, Guillermo Durán, Javier Marenco:
Solving the segmentation problem for the 2010 Argentine census with integer programming. 279-284 - Rafael Ayala, Desamparados Fernández-Ternero, José Antonio Vilches:
A graph-theoretical approach to cancelling critical elements. 285-290 - Letícia Rodrigues Bueno, Celina M. H. de Figueiredo, Luérbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen:
Hamiltonian Cycles in Kneser Graphs for n=2k+2. 291-296 - Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Subdense Instances of Covering Problems. 297-302 - Javier Marenco, Daniela Sabán:
Combinatorial properties and further facets of maximum edge subgraph polytopes. 303-308 - Pedro Augusto Munari, Pablo González-Brevis, Jacek Gondzio:
A note on the primal-dual column generation method for combinatorial optimization. 309-314 - Dilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus:
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. 315-320 - Anderson Novaes Martinhão, Emerson L. Monte Carmelo:
Short coverings and matching in weighted graphs. 321-326 - Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness of complements of line graphs. 327-332 - Mitre Costa Dourado, Guillermo Durán, Luérbio Faria, Luciano N. Grippo, Martín Darío Safe:
Forbidden subgraphs and the Kőnig property. 333-338 - Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Probe interval and probe unit interval graphs on superclasses of cographs. 339-344 - Sounaka Mishra:
On the Maximum Uniquely Restricted Matching for Bipartite Graphs. 345-350 - Cristina G. Fernandes, Maya Stein:
Stability in geodesics for memoryless binary long-lived consensus. 351-356 - Ruslan Sadykov, François Vanderbeck:
Column Generation for Extended Formulations. 357-362 - Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
Polynomial instances of the Packing Coloring Problem. 363-368 - Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi:
Selfish Square Packing. 369-374 - Serafino Cicerone:
Characterizations of Graphs with Stretch Number less than 2. 375-380 - Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler:
A lower bound on the Chvátal-rank of Antiwebs. 381-386 - Anna Zych, Davide Bilò:
New Reoptimization Techniques applied to Steiner Tree Problem. 387-392 - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Near-perfect graphs with polyhedral N+(G). 393-398 - Mekkia Kouider, Mario Valencia-Pabon:
On lower bounds for the b-chromatic number of connected bipartite graphs. 399-404
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-22 20:03 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:
