default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th LATIN 2022: Guanajuato, Mexico
- Armando Castañeda
, Francisco Rodríguez-Henríquez:
LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings. Lecture Notes in Computer Science 13568, Springer 2022, ISBN 978-3-031-20623-8
Algorithms and Data Structures
- Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini:
Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. 3-19 - Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Matching with 1 Error. 20-37 - Amalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura:
Median and Hybrid Median K-Dimensional Trees. 38-53 - Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted Connected Matchings. 54-70 - Seungbum Jo, Geunho Kim:
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. 71-87 - Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares:
Near-Optimal Search Time in δ-Optimal Space. 88-103 - Charis Papadopoulos, Athanasios E. Zisis:
Computing and Listing Avoidable Vertices and Paths. 104-120 - Thore Thießen, Jan Vahrenhold:
Klee's Measure Problem Made Oblivious. 121-138
Approximation Algorithms
- Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa:
A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center. 141-156 - Julien Courtiel, Paul Dorbec, Romain Lecoq:
Theoretical Analysis of git bisect. 157-171 - Thomas Dissaux, Nicolas Nisse:
Pathlength of Outerplanar Graphs. 172-187 - Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura:
Approximations for the Steiner Multicycle Problem. 188-203 - Waldo Gálvez, Víctor Verdugo:
Approximation Schemes for Packing Problems with ℓ p-norm Diversity Constraints. 204-221 - Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang:
Obtaining Approximately Optimal and Diverse Solutions via Dispersion. 222-239
Cryptography
- Claude Carlet:
On APN Functions Whose Graphs are Maximal Sidon Sets. 243-254 - Félix Hernández, Gerardo Vega:
On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures. 255-270
Social Choice Theory
- Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger:
Multidimensional Manhattan Preferences. 273-289
Theoretical Machine Learning
- Ramtin Afshar, Michael T. Goodrich:
Exact Learning of Multitrees and Almost-Trees Using Path Queries. 293-311 - Nader H. Bshouty:
Almost Optimal Proper Learning and Testing Polynomials. 312-327 - Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Estimating the Clustering Coefficient Using Sample Complexity Analysis. 328-341
Automata Theory and Formal Languages
- David Casas, Mikhail V. Volkov:
Binary Completely Reachable Automata. 345-358 - Viktor Henriksson, Manfred Kufleitner:
Conelikes and Ranker Comparisons. 359-375 - Sylvain Lombardy, Jacques Sakarovitch:
The Net Automaton of a Rational Expression. 376-392 - Augusto Modanese, Thomas Worsch:
Embedding Arbitrary Boolean Circuits into Fungal Automata. 393-408 - Thomas Place, Marc Zeitoun:
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? 409-425 - Antonio Restivo, Giuseppe Romana, Marinella Sciortino:
String Attractors and Infinite Words. 426-442
Combinatorics and Graph Theory
- José D. Alvarado, Lucas Colucci, Roberto Parente, Victor Souza:
On the Zero-Sum Ramsey Problem over $\mathbb {Z}_2^d$. 445-459 - Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee:
On χ-Diperfect Digraphs with Stability Number Two. 460-475 - Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). 476-492 - Olivier Bodini, Antoine Genitrini, Mehdi Naima:
A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. 493-509 - Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. 510-526 - Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
On the Zombie Number of Various Graph Classes. 527-543 - Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski:
Patterns in Ordered (random) Matchings. 544-556 - Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Tree 3-Spanners on Generalized Prisms of Graphs. 557-573 - Carole Porrier, Thomas Fernique:
A General Approach to Ammann Bars for Aperiodic Tilings. 574-589
Complexity Theory
- Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma:
List Homomorphism: Beyond the Known Boundaries. 593-609 - Prasad Chaugule, Nutan Limaye:
On the Closures of Monotone Algebraic Classes and Variants of the Determinant. 610-625 - Ludmila Glinskih, Artur Riazanov:
MCSP is Hard for Read-Once Nondeterministic Branching Programs. 626-640 - François Le Gall, Daiki Suruga:
Bounds on Oblivious Multiparty Quantum Communication Complexity. 641-657 - Caroline Mattes, Armin Weiß:
Improved Parallel Algorithms for Generalized Baumslag Groups. 658-675
Computational Geometry
- Saman Bazargani, Ahmad Biniaz, Prosenjit Bose:
Piercing Pairwise Intersecting Convex Shapes in the Plane. 679-695 - Nicolas Bonichon, Prosenjit Bose, Yan Garito:
Local Routing Algorithms on Euclidean Spanners with Small Diameter. 696-712 - Vasco Cruz, Ana Paula Tomás:
On r-Guarding SCOTs - A New Family of Orthogonal Polygons. 713-729 - Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity Results on Untangling Red-Blue Matchings. 730-745 - Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski:
On Vertex Guarding Staircase Polygons. 746-760 - Hannah Miller Hillberg, Erik Krohn, Alex Pahlow:
On the Complexity of Half-Guarding Monotone Polygons. 761-777
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-29 01:14 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:
