LATIN B

53 papers

YearTitle / Authors
2016(k, n-k)-Max-Cut: An 𝒪
Saket Saurabh, Meirav Zehavi
2016A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2016A Bounded-Risk Mechanism for the Kidney Exchange Game.
Hossein Esfandiari, Guy Kortsarz
2016A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.
Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2016A Middle Curve Based on Discrete Fréchet Distance.
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf, Carola Wenk
2016A Parameterized Algorithm for Mixed-Cut.
Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2016Bidirectional Variable-Order de Bruijn Graphs.
Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi
2016Bundled Crossings in Embedded Graphs.
Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek
2016Chasing Convex Bodies and Functions.
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato
2016Comparison-Based FIFO Buffer Management in QoS Switches.
Kamal Al-Bawani, Matthias Englert, Matthias Westermann
2016Compressing Bounded Degree Graphs.
Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep
2016Computing Maximal Layers of Points in E
Indranil Banerjee, Dana Richards
2016Computing a Geodesic Two-Center of Points in a Simple Polygon.
Eunjin Oh, Sang Won Bae, Hee-Kap Ahn
2016Constructing Consistent Digital Line Segments.
Iffat Chowdhury, Matt Gibson
2016Containment and Evasion in Stochastic Point Data.
Nirman Kumar, Subhash Suri
2016Deterministic Sparse Suffix Sorting on Rewritable Texts.
Johannes Fischer, Tomohiro I, Dominik Köppl
2016Edge-Editing to a Dense and a Sparse Graph Class.
Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak
2016Faster Algorithms to Enumerate Hypergraph Transversals.
Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
2016Faster Information Gathering in Ad-Hoc Radio Tree Networks.
Marek Chrobak, Kevin P. Costello
2016From Discrepancy to Majority.
David Eppstein, Daniel S. Hirschberg
2016Generating Random Spanning Trees via Fast Matrix Multiplication.
Nicholas J. A. Harvey, Keyulu Xu
2016Graph Drawings with One Bend and Few Slopes.
Kolja Knauer, Bartosz Walczak
2016Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
2016Improved Spanning Ratio for Low Degree Plane Spanners.
Prosenjit Bose, Darryl Hill, Michiel H. M. Smid
2016Increasing Diamonds.
Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang
2016Independent Set of Convex Polygons: From n
Andreas Wiese
2016LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings
Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez
2016Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
2016Listing Acyclic Orientations of Graphs with Single and Multiple Sources.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2016Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings.
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
2016New Deterministic Algorithms for Solving Parity Games.
Matthias Mnich, Heiko Röglin, Clemens Rösner
2016On Mobile Agent Verifiable Problems.
Evangelos Bampas, David Ilcinkas
2016On the Planar Split Thickness of Graphs.
David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
2016On the Total Number of Bends for Planar Octilinear Drawings.
Michael A. Bekos, Michael Kaufmann, Robert Krug
2016Parameterized Complexity of Red Blue Set Cover for Lines.
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2016Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems.
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2016Period Recovery over the Hamming and Edit Distances.
Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol
2016Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering.
Carsten Fischer, Heiko Röglin
2016Random Partial Match in Quad-K-d Trees.
Amalia Duch, Gustavo Lau, Conrado Martínez
2016Rank Reduction of Directed Graphs by Vertex and Edge Deletions.
Syed Mohammad Meesum, Saket Saurabh
2016Routing in Unit Disk Graphs.
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth
2016Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek
2016Scheduling on Power-Heterogeneous Processors.
Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz
2016Simple Approximation Algorithms for Balanced MAX 2SAT.
Alice Paul, Matthias Poloczek, David P. Williamson
2016Stabbing Circles for Sets of Segments in the Plane.
Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara
2016The Grandmama de Bruijn Sequence for Binary Strings.
Patrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams
2016The I/O Complexity of Computing Prime Tables.
Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton, Pramod Ganapathi, Rob Johnson, Samuel McCauley, Bertrand Simon, Shikha Singh
2016The Read/Write Protocol Complex Is Collapsible.
Fernando Benavides, Sergio Rajsbaum
2016Tight Approximations of Degeneracy in Large Graphs.
Martin Farach-Colton, Meng-Tsung Tsai
2016Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons.
Sang Won Bae, Chan-Su Shin, Antoine Vigneron
2016Tree Compression Using String Grammars.
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth
2016Trees and Languages with Periodic Signature.
Victor Marsault, Jacques Sakarovitch
2016Unshuffling Permutations.
Samuele Giraudo, Stéphane Vialette