default search action
12. LATIN 2016: Ensenada, Mexico
- Evangelos Kranakis
, Gonzalo Navarro, Edgar Chávez:
LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings. Lecture Notes in Computer Science 9644, Springer 2016, ISBN 978-3-662-49528-5 - Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. 1-13 - Hee-Kap Ahn
A Middle Curve Based on Discrete Fréchet Distance. 14-26 - Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Comparison-Based FIFO Buffer Management in QoS Switches. 27-40 - Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
Scheduling on Power-Heterogeneous Processors. 41-54 - Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period Recovery over the Hamming and Edit Distances. 55-67 - Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato:
Chasing Convex Bodies and Functions. 68-81 - N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. 82-95 - Pradeesha Ashok
Parameterized Complexity of Red Blue Set Cover for Lines. 96-109 - Sang Won Bae
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons. 110-122 - Evangelos Bampas, David Ilcinkas:
On Mobile Agent Verifiable Problems. 123-137 - Indranil Banerjee, Dana Richards:
Computing Maximal Layers of Points in Ef(n). 138-151 - Michael A. Bekos
On the Total Number of Bends for Planar Octilinear Drawings. 152-163 - Djamal Belazzougui, Travis Gagie
Bidirectional Variable-Order de Bruijn Graphs. 164-178 - Fernando Benavides, Sergio Rajsbaum:
The Read/Write Protocol Complex Is Collapsible. 179-191 - Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton
The I/O Complexity of Computing Prime Tables. 192-206 - Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang
Increasing Diamonds. 207-219 - Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek:
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. 220-234 - Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. 235-248 - Prosenjit Bose
Improved Spanning Ratio for Low Degree Plane Spanners. 249-262 - Iffat Chowdhury, Matt Gibson:
Constructing Consistent Digital Line Segments. 263-274 - Marek Chrobak, Kevin P. Costello
Faster Information Gathering in Ad-Hoc Radio Tree Networks. 275-289 - Mercè Claverol
Stabbing Circles for Sets of Segments in the Plane. 290-305 - Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch:
Faster Algorithms to Enumerate Hypergraph Transversals. 306-318 - Alessio Conte, Roberto Grossi, Andrea Marino
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. 319-333 - Maxime Crochemore, Gabriele Fici
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. 334-346 - Patrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams:
The Grandmama de Bruijn Sequence for Binary Strings. 347-361 - Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep:
Compressing Bounded Degree Graphs. 362-375 - Amalia Duch, Gustavo Lau, Conrado Martínez
Random Partial Match in Quad-K-d Trees. 376-389 - David Eppstein, Daniel S. Hirschberg:
From Discrepancy to Majority. 390-402 - David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. 403-415 - Hossein Esfandiari, Guy Kortsarz:
A Bounded-Risk Mechanism for the Kidney Exchange Game. 416-428 - Martin Farach-Colton, Meng-Tsung Tsai
Tight Approximations of Degeneracy in Large Graphs. 429-440 - Cristina G. Fernandes
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. 441-453 - Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek
Bundled Crossings in Embedded Graphs. 454-468 - Carsten Fischer, Heiko Röglin:
Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering. 469-482 - Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting on Rewritable Texts. 483-496 - Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. 497-508 - Samuele Giraudo, Stéphane Vialette:
Unshuffling Permutations. 509-521 - Nicholas J. A. Harvey, Keyulu Xu:
Generating Random Spanning Trees via Fast Matrix Multiplication. 522-535 - Haim Kaplan, Wolfgang Mulzer
Routing in Unit Disk Graphs. 536-548 - Kolja Knauer
Graph Drawings with One Bend and Few Slopes. 549-561 - Michal Kotrbcík, Rastislav Královic
Edge-Editing to a Dense and a Sparse Graph Class. 562-575 - Nirman Kumar, Subhash Suri:
Containment and Evasion in Stochastic Point Data. 576-589 - Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth:
Tree Compression Using String Grammars. 590-604 - Victor Marsault, Jacques Sakarovitch:
Trees and Languages with Periodic Signature. 605-618 - Syed Mohammad Meesum, Saket Saurabh:
Rank Reduction of Directed Graphs by Vertex and Edge Deletions. 619-633 - Matthias Mnich
New Deterministic Algorithms for Solving Parity Games. 634-645 - Eunjin Oh, Sang Won Bae
Computing a Geodesic Two-Center of Points in a Simple Polygon. 646-658 - Alice Paul, Matthias Poloczek, David P. Williamson:
Simple Approximation Algorithms for Balanced MAX 2SAT. 659-671 - Ashutosh Rai, M. S. Ramanujan, Saket Saurabh:
A Parameterized Algorithm for Mixed-Cut. 672-685 - Saket Saurabh, Meirav Zehavi
(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel. 686-699 - Andreas Wiese:
Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking. 700-711
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-15 01:15 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: