default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th LATIN 2020: São Paulo, Brazil
- Yoshiharu Kohayakawa
, Flávio Keidi Miyazawa:
LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings. Lecture Notes in Computer Science 12118, Springer 2020, ISBN 978-3-030-61791-2
Approximation Algorithms
- Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. 3-14 - Ran Duan, Haoqing He, Tianyi Zhang:
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. 15-26 - Khaled M. Elbassioni:
Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations. 27-37 - Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon:
Scheduling on Hybrid Platforms: Improved Approximability Window. 38-49 - Cristina G. Fernandes, Carla Negri Lintzmayer:
Leafy Spanning Arborescences in DAGs. 50-62 - Lehilton L. C. Pedrosa, Greis Y. O. Quesquén:
Approximating Routing and Connectivity Problems with Multiple Distances. 63-75 - Lehilton L. C. Pedrosa, Hugo K. K. Rosado:
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. 76-88
Parameterized Algorithms
- Ivan Bliznets, Danil Sagunov:
Maximizing Happiness in Graphs of Bounded Clique-Width. 91-103 - Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi:
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. 104-115 - Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. 116-128 - Guilherme de C. M. Gomes, Matheus R. Guedes, Vinícius Fernandes dos Santos:
Structural Parameterizations for Equitable Coloring. 129-140
Algorithms and Data Structures
- Chen Avin, Kaushik Mondal, Stefan Schmid:
Dynamically Optimal Self-adjusting Single-Source Tree Networks. 143-154 - Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas:
Batched Predecessor and Sorting with Size-Priced Information in External Memory. 155-167 - Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). 168-180 - Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization Under Stochastic Uncertainty. 181-193 - Shunsuke Inenaga:
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. 194-206 - Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Towards a Definitive Measure of Repetitiveness. 207-219
Computational Geometry
- Elena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Flips in Higher Order Delaunay Triangulations. 223-234 - Frank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack:
An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. 235-246 - Sergey Bereg:
Computing Balanced Convex Partitions of Lines. 247-257 - Kevin Buchin, Dmitry Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Ordered Strip Packing. 258-270 - Mincheol Kim, Sang Duk Yoon, Hee-Kap Ahn:
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. 271-282 - Ioannis Mantas, Evanthia Papadopoulou, Vera Sacristán, Rodrigo I. Silveira:
Farthest Color Voronoi Diagrams: Complexity and Algorithms. 283-295 - Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia:
Rectilinear Convex Hull of Points in 3D. 296-307
Complexity Theory
- Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. 311-322 - Siddhesh Chaubal, Anna Gál:
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. 323-335 - Stefan S. Dantchev, Abdul Ghani, Barnaby Martin:
Sherali-Adams and the Binary Encoding of Combinatorial Principles. 336-347 - Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Hardness of Variants of the Graph Coloring Game. 348-359 - Md Lutfar Rahman, Thomas Watson:
Tractable Unordered 3-CNF Games. 360-372
Quantum Computing
- Costin Badescu, Ryan O'Donnell:
Lower Bounds for Testing Complete Positivity and Quantum Separability. 375-386 - Kazuya Shimizu, Ryuhei Mori:
Exponential-Time Quantum Algorithms for Graph Coloring Problems. 387-398
Neural Networks and Biologically Inspired Computing
- Ido Nachum, Amir Yehudayoff:
On Symmetry and Initialization for Neural Networks. 401-412 - Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. 413-424 - Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Yuki Ubukata:
Simple Intrinsic Simulation of Cellular Automata in Oritatami Molecular Folding Model. 425-436
Randomization
- Ny Aina Andriambolamalala, Vlady Ravelomanana:
Transmitting once to Elect a Leader on Wireless Networks. 439-450 - Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Asymptotics for Push on the Complete Graph. 451-463 - Andrew Read-McFarland, Daniel Stefankovic:
The Hardness of Sampling Connected Subgraphs. 464-475
Combinatorics
- Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. 479-490 - Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé:
Quasi-Random Words and Limits of Word Sequences. 491-503 - Benjamin Rossman:
Thresholds in the Lattice of Subspaces of $\mathbb {F}_q^n$. 504-515
Analytic and Enumerative Combinatorics
- Gill Barequet, Gil Ben-Shachar:
On Minimal-Perimeter Lattice Animals. 519-531 - Gill Barequet, Mira Shalah:
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. 532-545 - Louisa Seelbach Benkner, Stephan G. Wagner:
On the Collection of Fringe Subtrees in Random Binary Trees. 546-558 - Miklós Bóna:
A Method to Prove the Nonrationality of Some Combinatorial Generating Functions. 559-570 - Julien Clément, Antoine Genitrini:
Binary Decision Diagrams: From Tree Compaction to Sampling. 571-583
Graph Theory
- Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza:
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. 587-599 - Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov:
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. 600-612 - Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. 613-624 - Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Some Subclasses of Split B1-EPG Graphs. 625-636 - Marina Groshaus, André Luiz Pires Guedes, Fabricio Schiavon Kolberg:
On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs. 637-648
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 2025-02-07 23:56 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:
