LATIN

Keyphrases

Publications

2022

Antonio Restivo, Giuseppe Romana, Marinella Sciortino
String Attractors and Infinite Words. LATIN (2022)
Sylvain Lombardy, Jacques Sakarovitch
The Net Automaton of a Rational Expression. LATIN (2022)
Saman Bazargani, Ahmad Biniaz, Prosenjit Bose
Piercing Pairwise Intersecting Convex Shapes in the Plane. LATIN (2022)
Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Red-Blue Matchings. LATIN (2022)
Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinicius F. dos Santos, Jayme Luiz Szwarcfiter
Weighted Connected Matchings. LATIN (2022)
Thomas Place, Marc Zeitoun
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? LATIN (2022)
Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN (2022)
Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
Near-Optimal Search Time in δ-Optimal Space. LATIN (2022)
Nader H. Bshouty
Almost Optimal Proper Learning and Testing Polynomials. LATIN (2022)
Carole Porrier, Thomas Fernique
A General Approach to Ammann Bars for Aperiodic Tilings. LATIN (2022)
Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
Patterns in Ordered (random) Matchings. LATIN (2022)
Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Tree 3-Spanners on Generalized Prisms of Graphs. LATIN (2022)
Luca Becchetti, Andrea E. F. Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). LATIN (2022)
Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma
List Homomorphism: Beyond the Known Boundaries. LATIN (2022)
Seungbum Jo, Geunho Kim
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. LATIN (2022)
Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa
A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center. LATIN (2022)
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. LATIN (2022)
Claude Carlet
On APN Functions Whose Graphs are Maximal Sidon Sets. LATIN (2022)
Prasad Chaugule, Nutan Limaye
On the Closures of Monotone Algebraic Classes and Variants of the Determinant. LATIN (2022)
François Le Gall, Daiki Suruga
Bounds on Oblivious Multiparty Quantum Communication Complexity. LATIN (2022)
Augusto Modanese, Thomas Worsch
Embedding Arbitrary Boolean Circuits into Fungal Automata. LATIN (2022)
Julien Courtiel, Paul Dorbec, Romain Lecoq
Theoretical Analysis of git bisect. LATIN (2022)
Vasco Cruz, Ana Paula Tomás
On r-Guarding SCOTs - A New Family of Orthogonal Polygons. LATIN (2022)
David Casas, Mikhail V. Volkov
Binary Completely Reachable Automata. LATIN (2022)
Nicolas Bonichon, Prosenjit Bose, Yan Garito
Local Routing Algorithms on Euclidean Spanners with Small Diameter. LATIN (2022)
Ludmila Glinskih, Artur Riazanov
MCSP is Hard for Read-Once Nondeterministic Branching Programs. LATIN (2022)
Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee
On χ-Diperfect Digraphs with Stability Number Two. LATIN (2022)
Félix Hernández, Gerardo Vega
On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures. LATIN (2022)
Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura
Approximations for the Steiner Multicycle Problem. LATIN (2022)
Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger
Multidimensional Manhattan Preferences. LATIN (2022)
Caroline Mattes, Armin Weiß
Improved Parallel Algorithms for Generalized Baumslag Groups. LATIN (2022)
Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang
Obtaining Approximately Optimal and Diverse Solutions via Dispersion. LATIN (2022)
Thomas Dissaux, Nicolas Nisse
Pathlength of Outerplanar Graphs. LATIN (2022)
Charis Papadopoulos, Athanasios E. Zisis
Computing and Listing Avoidable Vertices and Paths. LATIN (2022)
Amalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura
Median and Hybrid Median K-Dimensional Trees. LATIN (2022)
Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti
Estimating the Clustering Coefficient Using Sample Complexity Analysis. LATIN (2022)
Thore Thießen, Jan Vahrenhold
Klee's Measure Problem Made Oblivious. LATIN (2022)
Viktor Henriksson, Manfred Kufleitner
Conelikes and Ranker Comparisons. LATIN (2022)
Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski
On Vertex Guarding Staircase Polygons. LATIN (2022)
José D. Alvarado, Lucas Colucci, Roberto Parente, Victor Souza
On the Zero-Sum Ramsey Problem over $\mathbb {Z}_2^d$. LATIN (2022)
Waldo Gálvez, Víctor Verdugo
-norm Diversity Constraints. LATIN (2022)
Hannah Miller Hillberg, Erik Krohn, Alex Pahlow
On the Complexity of Half-Guarding Monotone Polygons. LATIN (2022)
Olivier Bodini, Antoine Genitrini, Mehdi Naima
A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. LATIN (2022)
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
On the Zombie Number of Various Graph Classes. LATIN (2022)
Ramtin Afshar, Michael T. Goodrich
Exact Learning of Multitrees and Almost-Trees Using Path Queries. LATIN (2022)
Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba
Elastic-Degenerate String Matching with 1 Error. LATIN (2022)

volume 13568, 2022

LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings LATIN 13568 (2022)

2020

volume 12118, 2020

LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings LATIN 12118 (2020)