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