Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 62
Volume 62, November 2017
- Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera
:
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. 1-2 - Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, Valentin Weber:
Recovery of disrupted airline operations using k-Maximum Matching in graphs. 3-8 - Tomás Feder, Pavol Hell:
Correspondence Homomorphisms to Reflexive Graphs. 9-14 - Manoel B. Campêlo, Daniel E. Severín:
Facets of the polytope of legal sequences. 15-20 - Luis Pedro Montejano, Jonathan Chappelon, Jorge Luis Ramírez Alfonsín:
Ramsey for complete graphs with a dropped edge or a triangle. 21-25 - Tien-Nam Le:
Locally self-avoiding Eulerian tours. 27-32 - Marina Groshaus, André Luiz Pires Guedes, Juan Pablo Puppo:
Biclique graph of bipartite permutation graphs. 33-38 - Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht:
On the local density problem for graphs of given odd-girth. 39-44 - Alvaro Javier Fuentes Suárez, Evelyne Hubert:
Scaffolding skeletons using spherical Voronoi diagrams. 45-50 - Rennan Dantas, Rudini M. Sampaio, Frédéric Havet:
Minimum density of identifying codes of king grids. 51-56 - Andreas Brandstädt, Raffaele Mosca:
On Efficient Domination for Some Classes of H-Free Chordal Graphs. 57-62 - Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo, Mardson Ferreira:
Minimum Linear Arrangements. 63-68 - Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindle in strongly connected digraphs with large chromatic number. 69-74 - Alexandre Xavier Martins, Christophe Duhamel, Andréa Cynthia Santos:
A column generation approach for the strong network orientation problem. 75-80 - Valerio Boncompagni, Irena Penev, Kristina Vuskovic:
Clique cutsets beyond chordal graphs. 81-86 - Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
Maximum Cuts in Edge-colored Graphs. 87-92 - Phablo F. S. Moura, Yoshiko Wakabayashi:
Strong intractability of generalized convex recoloring problems. 93-98 - Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach:
Intersection Graphs of Orthodox Paths in Trees. 99-104 - Nathan Chadder, Antoine Deza:
Computational determination of the largest lattice polytope diameter. 105-110 - Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs. 111-116 - Rafael Veiga Pocai:
Inapproximability Ratios for Crossing Number. 117-122 - Simone Dantas, Rodrigo Marinho, Slobodan Tanushevski:
The Solitaire Clobber game and correducibility. 123-128 - Isidoro Gitler, Gustavo Sandoval-Angeles:
Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs. 129-134 - Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of Longest Paths. 135-140 - Bruno Dias, Rosiane de Freitas Rodrigues, Nelson Maculan, Javier Marenco:
Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model. 141-146 - Fábio Botler, Maycon Sambinelli:
Gallai's conjecture for graphs with treewidth 3. 147-152 - Matthias Köppe, Jiawei Wang:
Structure and Interpretation of Dual-Feasible Functions. 153-158 - Martín Matamala, José Zamora:
Graphs admitting antimagic labeling for arbitrary sets of positive integers. 159-164 - Renata R. Del-Vecchio, Cybele T. M. Vinagre, Guilherme B. Pereira:
Hyper-Hamiltonicity in graphs: some sufficient conditions. 165-170 - Arman Boyaci, Jérôme Monnot:
Weighted upper domination number. 171-176 - Lucas Isenmann, Timothée Pecatte:
Möbius Stanchion Systems. 177-182 - Camile Frazão Bordini, André Luís Vignatti:
An Approximation Algorithm for the p-Hub Median Problem. 183-188 - Miguel A. Pizaña, I. A. Robles:
On cliques and bicliques. 189-194 - Júlio Araújo, Julien Baste, Ignasi Sau:
Ruling out FPT algorithms for Weighted Coloring on forests. 195-200 - Marcio Felix Reis, Mário César San Felice, Orlando Lee, Fábio Luiz Usberti:
A 3-approximation algorithm for the maximum leaf k-forest problem. 201-206 - Luana Cordeiro, Simone Dantas, Diana Sasaki:
On Type 2 Snarks and Dot Products. 207-212 - César Hernández-Cruz, Jesús Alva-Samos:
k-quasi-transitive digraphs of large diameter. 213-218 - Johanne Cohen, Yannis Manoussakis, Hong Phong Pham, Zsolt Tuza:
Tropical matchings in vertex-colored graphs. 219-224 - Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
On Generalizations of the Parking Permit Problem and Network Leasing Problems. 225-230 - Liliana Alcón, Miguel A. Pizaña, Gabriela Ravenna:
On the Existence of Critical Clique-Helly Graphs. 231-236 - Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa:
On the (di)graphs with (directed) proper connection number two. 237-242 - Christophe Picouleau, Daniël Paulusma, Bernard Ries:
Reducing the Chromatic Number by Vertex or Edge Deletions. 243-248 - Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
A linear-time algorithm for the identifying code problem on block graphs. 249-254 - Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler:
Fleet management for autonomous vehicles using flows in time-expanded networks. 255-260 - Cláudia Linhares Sales, Leonardo Sampaio Rocha, Ana Silva:
The lexicographic product of some chordal graphs and of cographs preserves b-continuity. 261-266 - Henri Perret du Cray, Mourad Baïou, Laurent Beaudou, Vincent Limouzy:
Bounds on Directed star arboricity in some digraph classes. 267-272 - Mayara M. Omai, Sheila Morais de Almeida, Diana Sasaki:
AVD-edge coloring on powers of paths. 273-278 - Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand. 279-284 - Pablo De Caria:
On the recognition of neighborhood inclusion posets. 285-290 - Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. 291-296 - Luiz Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín Darío Safe, Vilmar Trevisan:
On graphs with a single large Laplacian eigenvalue. 297-302 - Olga Kuryatnikova, Juan Carlos Vera Lizcano:
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs. 303-308 - Mónica Braga, Diego Delle Donne, Mariana S. Escalante, Javier Marenco, María Elisa Ugarte, María del Carmen Varaldo:
The minimum chromatic violation problem: a polyhedral study. 309-314 - Ngoc-Khang Le:
Detecting an induced subdivision of K4. 315-320
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-06-25 20:48 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:
