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

[Home] [All LATIN Papers] [LATIN 2022]