| 2023 | A canonical Ramsey theorem with list constraints in random graphs. José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota |
| 2023 | A de Bruijn and Erdös property in quasi-metric spaces with four points. Gabriela Araujo-Pardo, Martín Matamala, José Zamora |
| 2023 | A general approximation for multistage subgraph problems. Markus Chimani, Niklas Troost, Tilo Wiedera |
| 2023 | A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement). Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret K. Wagler |
| 2023 | Adjacent vertex distinguishing total coloring of corona products (Brief Announcement). Hanna Furmanczyk, Rita Zuazua |
| 2023 | Biclique coloring game (Brief Announcement). Paola T. P. Huaynoca, Simone Dantas, Daniel F. D. Posner |
| 2023 | Biclique transversal and biclique independen set. Marina Groshaus, Juan Carlos Terragno |
| 2023 | Canonical colourings in random graphs. Nina Kamcev, Mathias Schacht |
| 2023 | Characterization of balanced graphs within claw-free graphs. Lucía Busolini, Guillermo Durán, Martín D. Safe |
| 2023 | Characterization of graphs with perfect closed neighbourhood matrices. Mariana S. Escalante, Erica G. Hinrichsen |
| 2023 | Common edge independence number of a tree (Brief Announcement). Magda Dettlaff, Magdalena Lemanska, Jerzy Topp |
| 2023 | Complexity and winning strategies of graph convexity games (Brief Announcement). Samuel N. Araújo, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio |
| 2023 | Computacional complexity of Hajós constructions of symmetric odd cycles. Jorge Cervantes-Ojeda, Juan Carlos García-Altamirano, Mika Olsen |
| 2023 | Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement). Harmender Gahlawat, Zin Mar Myint, Sagnik Sen |
| 2023 | Counting lines in semi-complete digraphs *. Gabriela Araujo-Pardo, Martín Matamala, José Zamora |
| 2023 | Crossing numbers of complete bipartite graphs. József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro |
| 2023 | Descriptive complexity of controllable graphs. Aida Abiad, Anuj Dawar, Octavio Zapata |
| 2023 | Edge and non-edge differentiated biclique graphs. Edmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes |
| 2023 | Fair subgraph selection for contagion containment (Brief Announcement). Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran |
| 2023 | Five edge-independent spanning trees. Alonso Ali, Orlando Lee |
| 2023 | Freeze-Tag is NP-hard in 3D with L Lehilton Lelis Chaves Pedrosa, Lucas de Oliveira Silva |
| 2023 | Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices. Joseph Hyde, Bruce Reed |
| 2023 | Graphs with constant balancing number. Yair Caro, Ileana González-Escalante, Adriana Hansberg, Mariel Jácome, Tonatiuh Matos Wiederhold, Amanda Montejano |
| 2023 | Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. Romaric Duvignau, Ralf Klasing |
| 2023 | Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel. Matheus Simões, Laura Bahiense, Celina M. H. de Figueiredo |
| 2023 | Identifying codes in bipartite graphs of given maximum degree. Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä |
| 2023 | Kochol superposition of Goldberg with Semi-blowup snarks is Type 1. Miguel A. D. R. Palma, Simone Dantas, Diana Sasaki |
| 2023 | Least corank for the nonexistence of uniformly most reliable graphs. Pablo Romero, Martín D. Safe |
| 2023 | Lower bounds and exact values of the 2-color off-diagonal generalized weak Schur numbers T. Ahmed, Luis Boza, M. P. Revuelta, María Isabel Sanz Domínguez |
| 2023 | Managing Time Expanded Networks through Project and Lift: the Lift Issue. José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret K. Wagler |
| 2023 | Min-max coverage problems on tree-like metrics. Eric Aaron, Úrsula Hébert-Johnson, Danny Krizanc, Daniel Lokshtanov |
| 2023 | Mixed integer programming and quadratic programming formulations for the interval count problem. Lívia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter |
| 2023 | Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. Serafino Cicerone, Gabriele Di Stefano |
| 2023 | Obstructions for χ-diperfectness. Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee |
| 2023 | On general packing functions in graphs (Brief Announcement). Erica Hinrichsen, Graciela L. Nasini, Natalí Vansteenkiste |
| 2023 | On nonrepetitive colorings of cycles. Fábio Botler, Wanderson Lomenha, João Pedro de Souza |
| 2023 | On prescribing total orders for bipartite sets of distances in the Euclidean Plane. Gerardo L. Maldonado, Miguel Raggi, Edgardo Roldán-Pensado |
| 2023 | On the absolute and relative oriented clique problems' time complexity. Erika Morais Martins Coelho, Hebert Coelho da Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein |
| 2023 | On the detection of local and global amoebas: theoretical insights and practical algorithms (Brief Announcement). Marcos E. González Laffitte, J. René González-Martínez, Amanda Montejano |
| 2023 | On the hull and interval numbers of oriented graphs (Brief Announcement). Júlio Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso |
| 2023 | Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections. Yaqiao Li, Denis Pankratov |
| 2023 | P3-Carathéodory number on graphs with diameter two (Brief Announcement). Erika M. M. Coelho, Hebert Coelho, Braully Rocha |
| 2023 | Polarity on H-split graphs. Fernando Esteban Contreras-Mendoza, César Hernández-Cruz |
| 2023 | Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery |
| 2023 | Preprocessing complexity for some graph problems parameterized by structural parameters. Manuel Lafond, Weidong Luo |
| 2023 | Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2023, Huatulco, Mexico, September 18-22, 2023. Cristina G. Fernandes, Sergio Rajsbaum |
| 2023 | Recovering cyclic tilings through β-skeletons. Héctor Saib Maravillo Gómez, Gilberto Calvillo Vives, Erick Treviño-Aguilar |
| 2023 | Reductions for the 3-Decomposition Conjecture. Oliver Bachtler, Irene Heinrich |
| 2023 | Resilience for loose Hamilton cycles. José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni |
| 2023 | Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem. Stephen Arndt, Josh Ascher, Kirk Pruhs |
| 2023 | Semi-proper orientations of dense graphs. Júlio Araújo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan |
| 2023 | Sidon sets and Sidon-partitions in cyclic groups through almost different sets. Luis-Miguel Delgado, Amanda Montejano, Hamilton Ruiz, Carlos Trujillo |
| 2023 | Simple certifying algorithms for variants of the (2, 1)-colouring problem. Fernando Esteban Contreras-Mendoza, César Hernández-Cruz |
| 2023 | Spherical fullerene graphs that do not satisfy Andova and Škrekovski's conjecture. Thiago M. D. Silva, Diego S. Nicodemos, Simone Dantas |
| 2023 | The Conversion Set Problem on Graphs. Isac Costa, Carlos V. G. C. Lima, Thiago Marcilon |
| 2023 | The Problem of Discovery in Version Control Systems. Laurent Bulteau, Pierre-Yves David, Florian Horn |
| 2023 | Unavoidable patterns in 2-colorings of the complete bipartite graph. Adriana Hansberg, Denae Ventura |
| 2023 | Voltage graphs as a technique to obtaining semi-cubic cages (Brief Announcement). Flor Aguilar-Campos, Gabriela Araujo-Pardo, Leah Wrenn Berman |