default search action
12th LAGOS 2023: Huatulco, Mexico
- Cristina G. Fernandes, Sergio Rajsbaum:
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2023, Huatulco, Mexico, September 18-22, 2023. Procedia Computer Science 223, Elsevier 2023 - Nina Kamcev, Mathias Schacht:
Canonical colourings in random graphs. 5-12 - José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris
, Guilherme Oliveira Mota:
A canonical Ramsey theorem with list constraints in random graphs. 13-19 - Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of controllable graphs. 20-27 - Gerardo L. Maldonado, Miguel Raggi, Edgardo Roldán-Pensado:
On prescribing total orders for bipartite sets of distances in the Euclidean Plane. 28-34 - Matheus Simões, Laura Bahiense, Celina M. H. de Figueiredo:
Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel. 35-42 - Romaric Duvignau
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. 43-52 - Edmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes:
Edge and non-edge differentiated biclique graphs. 53-61 - M. Escalante, Erica G. Hinrichsen:
Characterization of graphs with perfect closed neighbourhood matrices. 62-69 - Yaqiao Li, Denis Pankratov:
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections. 70-77 - József Balogh, Bernard Lidický
Crossing numbers of complete bipartite graphs. 78-87 - Pablo Romero, Martín D. Safe:
Least corank for the nonexistence of uniformly most reliable graphs. 88-95 - Oliver Bachtler
Reductions for the 3-Decomposition Conjecture. 96-103 - Serafino Cicerone, Gabriele Di Stefano:
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. 104-111 - Jorge Cervantes-Ojeda, Juan Carlos García-Altamirano, Mika Olsen:
Computacional complexity of Hajós constructions of symmetric odd cycles. 112-120 - Stephen Arndt, Josh Ascher, Kirk Pruhs:
Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem. 121-129 - Manuel Lafond, Weidong Luo:
Preprocessing complexity for some graph problems parameterized by structural parameters. 130-139 - Marina Groshaus, Juan Carlos Terragno:
Biclique transversal and biclique independen set. 140-147 - Eric Aaron, Úrsula Hébert-Johnson, Danny Krizanc, Daniel Lokshtanov:
Min-max coverage problems on tree-like metrics. 148-156 - Dipayan Chakraborty
Identifying codes in bipartite graphs of given maximum degree. 157-165 - Adriana Hansberg, Denae Ventura:
Unavoidable patterns in 2-colorings of the complete bipartite graph. 166-174 - Isac Costa, Carlos V. G. C. Lima, Thiago Marcilon:
The Conversion Set Problem on Graphs. 175-183 - Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Polarity on H-split graphs. 184-192 - José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni:
Resilience for loose Hamilton cycles. 193-200 - Caroline Aparecida de Paula Silva
Obstructions for χ-diperfectness. 201-208 - Laurent Bulteau, Pierre-Yves David, Florian Horn:
The Problem of Discovery in Version Control Systems. 209-216 - Joseph Hyde, Bruce Reed:
Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices. 217-222 - Alonso Ali, Orlando Lee:
Five edge-independent spanning trees. 223-230 - J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan
Semi-proper orientations of dense graphs. 231-240 - José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Managing Time Expanded Networks through Project and Lift: the Lift Issue. 241-249 - Miguel A. D. R. Palma, Simone Dantas, Diana Sasaki:
Kochol superposition of Goldberg with Semi-blowup snarks is Type 1. 250-257 - Lucía Busolini, Guillermo Durán, Martín D. Safe:
Characterization of balanced graphs within claw-free graphs. 258-266 - Luis-Miguel Delgado, Amanda Montejano, Hamilton Ruiz, Carlos Trujillo:
Sidon sets and Sidon-partitions in cyclic groups through almost different sets. 267-274 - Erika Morais Martins Coelho, Hebert Coelho da Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein:
On the absolute and relative oriented clique problems' time complexity. 275-282 - Lívia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter:
Mixed integer programming and quadratic programming formulations for the interval count problem. 283-291 - Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Simple certifying algorithms for variants of the (2, 1)-colouring problem. 292-301 - Fábio Botler
On nonrepetitive colorings of cycles. 302-307 - Gabriela Araujo-Pardo, Martín Matamala, J. Zamora:
A de Bruijn and Erdös property in quasi-metric spaces with four points. 308-315 - Thiago M. D. Silva, Diego S. Nicodemos, Simone Dantas:
Spherical fullerene graphs that do not satisfy Andova and Škrekovski's conjecture. 316-324 - Yair Caro, Ileana González-Escalante, Adriana Hansberg, Mariel Jácome, Tonatiuh Matos Wiederhold, Amanda Montejano:
Graphs with constant balancing number. 325-333 - Markus Chimani, Niklas Troost, Tilo Wiedera:
A general approximation for multistage subgraph problems. 334-342 - Héctor Saib Maravillo Gómez
Recovering cyclic tilings through β-skeletons. 343-351 - Gabriela Araujo-Pardo, Martín Matamala, José Zamora:
Counting lines in semi-complete digraphs *. 352-359 - Lehilton Lelis Chaves Pedrosa, Lucas de Oliveira Silva:
Freeze-Tag is NP-hard in 3D with L1 distance. 360-366
- Erica Hinrichsen, Graciela Nasini, Natalí Vansteenkiste:
On general packing functions in graphs (Brief Announcement). 367-369 - Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran:
Fair subgraph selection for contagion containment (Brief Announcement). 370-372 - Paola T. P. Huaynoca, Simone Dantas, Daniel F. D. Posner:
Biclique coloring game (Brief Announcement). 373-375 - Marcos E. González Laffitte, J. René González-Martínez, Amanda Montejano:
On the detection of local and global amoebas: theoretical insights and practical algorithms (Brief Announcement). 376-378 - Harmender Gahlawat, Zin Mar Myint, Sagnik Sen:
Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement). 379-381 - Hanna Furmanczyk, Rita Zuazua:
Adjacent vertex distinguishing total coloring of corona products (Brief Announcement). 382-384 - Magda Dettlaff, Magdalena Lemanska, Jerzy Topp:
Common edge independence number of a tree (Brief Announcement). 385-387 - Erika M. M. Coelho, Hebert Coelho, Braully Rocha:
P3-Carathéodory number on graphs with diameter two (Brief Announcement). 388-390 - Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret Wagler:
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement). 391-393 - Samuel N. Araújo, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio:
Complexity and winning strategies of graph convexity games (Brief Announcement). 394-396 - J. Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso:
On the hull and interval numbers of oriented graphs (Brief Announcement). 397-399 - Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery:
Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). 400-402 - T. Ahmed, Luis Boza, M. P. Revuelta, María Isabel Sanz Domínguez:
Lower bounds and exact values of the 2-color off-diagonal generalized weak Schur numbers WS(2;k1, k2) (Brief Announcement). 403-405 - Flor Aguilar-Campos, Gabriela Araujo-Pardo, Leah Wrenn Berman:
Voltage graphs as a technique to obtaining semi-cubic cages (Brief Announcement). 406-408
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-12-19 22:20 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: