default search action
13th LATIN 2018: Buenos Aires, Argentina
- Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Lecture Notes in Computer Science 10807, Springer 2018, ISBN 978-3-319-77403-9 - Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo
, Luis A. B. Kowada, Franklin L. Marquezino
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. 1-13 - Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal
Approximate Correlation Clustering Using Same-Cluster Queries. 14-27 - Peter Allen
Finding Tight Hamilton Cycles in Random Hypergraphs Faster. 28-36 - Saeed Akhoondian Amiri
Walking Through Waypoints. 37-51 - Antonios Antoniadis, Carsten Fischer, Andreas Tönnis
A Collection of Lower Bounds for Online Matching on the Line. 52-65 - Júlio Araújo
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. 66-79 - Sandip Banerjee
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. 80-93 - Aritra Banik
A Polynomial Sized Kernel for Tracking Paths Problem. 94-107 - Bahareh Banyassady
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees. 108-119 - Yair Bartal, Lee-Ad Gottlieb
Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via Embeddings. 120-133 - Florent Becker, Pedro Montealegre
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. 134-145 - Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw
Partitioning Orthogonal Histograms into Rectangular Boxes. 146-160 - Lélia Blin, Sébastien Tixeuil:
Compact Self-Stabilizing Leader Election for General Networks. 161-173 - Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc P. Renault:
Random Walks with Multiple Step Lengths. 174-186 - Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay:
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. 187-200 - Bartlomiej Bosek
A Tight Bound for Shortest Augmenting Paths on Trees. 201-216 - Thomas Bosman
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. 217-230 - Luis Evaristo Caraballo, Pablo Pérez-Lantero
Maximum Box Problem on Stochastic Points. 231-244 - Rodrigo A. Carrasco
The Online Set Aggregation Problem. 245-259 - Thom Castermans, Bettina Speckmann
Agglomerative Clustering of Growing Squares. 260-274 - Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. 275-289 - Panagiotis Charalampopoulos
Property Suffix Array with Applications. 290-302 - Vincent Chau, Shengzhong Feng, Kim Thang Nguyen:
Competitive Algorithms for Demand Response Management in Smart Grid. 303-316 - Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam:
An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0. 317-330 - Anders Roy Christiansen, Mikko Berggren Ettienne:
Compressed Indexing with Signature Grammars. 331-345 - Jonas Cleve
Combinatorics of Beacon-Based Routing in Three Dimensions. 346-360 - Zakir Deniz
On Split B_1 B 1 -EPG Graphs. 361-375 - Tamal K. Dey, Tianqi Li, Yusu Wang:
Efficient Algorithms for Computing a Minimal Homology Basis. 376-398 - Sergey Dovgal, Vlady Ravelomanana:
Shifting the Phase Transition Threshold for Random Graphs Using Degree Set Constraints. 399-412 - Philippe Duchon, Cyril Nicaud:
On the Biased Partial Word Collector Problem. 413-426 - Andrzej Dudek, Andrzej Rucinski
Constructive Ramsey Numbers for Loose Hyperpaths. 427-436 - Matteo Dusefante, Riko Jacob:
Cache Oblivious Sparse Matrix Multiplication. 437-447 - Sándor P. Fekete
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading. 448-460 - Carsten Fischer, Heiko Röglin
Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. 461-474 - Martin Fürer
Locating the Eigenvalues for Graphs of Small Clique-Width. 475-489 - Travis Gagie
On the Approximation Ratio of Lempel-Ziv Parsing. 490-503 - Hang Gao, Wenyu Gao:
Kernelization for Maximum Happy Vertices Problem. 504-514 - Serge Gaspers
When is Red-Blue Nonblocker Fixed-Parameter Tractable? 515-528 - Loukas Georgiadis
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. 529-543 - Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. 544-557 - Juan Gutiérrez
Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs. 558-571 - Bernd Gärtner, Ahad N. Zehmakan
Majority Model on Random Regular Graphs. 572-583 - Jie Han
Property Testing for Point Sets on the Plane. 584-596 - Meng He
Maximal and Convex Layers of Random Point Sets. 597-610 - Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi
Plane Gossip: Approximating Rumor Spread in Planar Graphs. 611-624 - L. Sunil Chandran, Anita Das
Algorithms and Bounds for Very Strong Rainbow Coloring. 625-639 - Adalat Jabrayilov
New Integer Linear Programming Models for the Vertex Coloring Problem. 640-652 - Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular Maximization with Uncertain Knapsack Capacity. 653-668 - Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat:
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time. 669-682 - Katharina Klost
Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors. 683-696 - Yoshiharu Kohayakawa
A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. 697-711 - R. Krithika
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. 712-726 - Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende
Satisfying Neighbor Preferences on a Circle. 727-740 - Carla Negri Lintzmayer
Two-Dimensional Knapsack for Circles. 741-754 - Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Maximize Throughput. 755-776 - David Eppstein, Michael T. Goodrich, Nil Mamano:
Reactive Proximity Data Structures for Graphs. 777-789 - Themistoklis Melissourgos
Mutants and Residents with Different Connection Graphs in the Moran Process. 790-804 - Wouter Meulemans, Bettina Speckmann
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs. 805-819 - Sarah Miracle, Amanda Pascoe Streib:
Rapid Mixing of k-Class Biased Permutations. 820-834 - Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth, Ahad N. Zehmakan
Transition Operations over Plane Trees. 835-848 - Pablo Rotondo, Brigitte Vallée, Alfredo Viola:
Analysis of the Continued Logarithm Algorithm. 849-863 - Thomas Watson:
Quadratic Simulations of Merlin-Arthur Games. 864-872 - Daniel Stefankovic
On Counting Perfect Matchings in General Graphs. 873-885
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-11-14 22:24 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: