Julien Clément and Antoine Genitrini, Binary Decision Diagrams: From Tree Compaction to Sampling. [Bibtex]
Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein and Uéverton S. Souza, Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into \(k\) Independent Sets and \(\ell\) Cliques. [Bibtex] Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch and Frederik Mallmann-Trenn, How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. [Bibtex] Ny Aina Andriambolamalala and Vlady Ravelomanana, Transmitting once to Elect a Leader on Wireless Networks. [Bibtex] Elena Arseneva, Prosenjit Bose, Pilar Cano and Rodrigo I. Silveira, Flips in Higher Order Delaunay Triangulations. [Bibtex] Chen Avin, Kaushik Mondal and Stefan Schmid, Dynamically Optimal Self-adjusting Single-Source Tree Networks. [Bibtex] Costin Badescu and Ryan O'Donnell, Lower Bounds for Testing Complete Positivity and Quantum Separability. [Bibtex] Gill Barequet and Gil Ben-Shachar, On Minimal-Perimeter Lattice Animals. [Bibtex] Gill Barequet and Mira Shalah, Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. [Bibtex] Frank Bauernöppel, Anil Maheshwari and Jörg-Rüdiger Sack, An \(\Omega(n^3)\) Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. [Bibtex] Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes and Kostas Tsichlas, Batched Predecessor and Sorting with Size-Priced Information in External Memory. [Bibtex] Louisa Seelbach Benkner and Stephan G. Wagner, On the Collection of Fringe Subtrees in Random Binary Trees. [Bibtex] Sergey Bereg, Computing Balanced Convex Partitions of Lines. [Bibtex] Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima and Daniel Lokshtanov, On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. [Bibtex] Ivan Bliznets and Danil Sagunov, Maximizing Happiness in Graphs of Bounded Clique-Width. [Bibtex] Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma and Erik Jan van Leeuwen, Steiner Trees for Hereditary Graph Classes. [Bibtex] Miklós Bóna, A Method to Prove the Nonrationality of Some Combinatorial Generating Functions. [Bibtex] Anthony Bonato, Konstantinos Georgiou, Calum MacRury and Pawel Pralat, Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). [Bibtex] Kevin Buchin, Dmitry Kosolobov, Willem Sonke, Bettina Speckmann and Kevin Verbeek, Ordered Strip Packing. [Bibtex] Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase and Sumedha Uniyal, PTAS for Steiner Tree on Map Graphs. [Bibtex] Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov and Luca Trevisan, Lower Bounds for Max-Cut via Semidefinite Programming. [Bibtex] Bruno Pasqualotto Cavalar, Mrinal Kumar and Benjamin Rossman, Monotone Circuit Lower Bounds from Robust Sunflowers. [Bibtex] Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima and Tigran Tonoyan, Query Minimization Under Stochastic Uncertainty. [Bibtex] Siddhesh Chaubal and Anna Gál, Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. [Bibtex] Rami Daknama, Konstantinos Panagiotou and Simon Reisser, Asymptotics for Push on the Complete Graph. [Bibtex] Stefan S. Dantchev, Abdul Ghani and Barnaby Martin, Sherali-Adams and the Binary Encoding of Combinatorial Principles. [Bibtex] Zakir Deniz, Simon Nivelle, Bernard Ries and David Schindl, On Some Subclasses of Split \(B_1\)-EPG Graphs. [Bibtex] Ran Duan, Haoqing He and Tianyi Zhang, Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. [Bibtex] Khaled M. Elbassioni, Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations. [Bibtex] Vincent Fagnon, Imed Kacem, Giorgio Lucarelli and Bertrand Simon, Scheduling on Hybrid Platforms: Improved Approximability Window. [Bibtex] Cristina G. Fernandes and Carla Negri Lintzmayer, Leafy Spanning Arborescences in DAGs. [Bibtex] Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh and Meirav Zehavi, Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. [Bibtex] Petr A. Golovach, Paloma T. Lima and Charis Papadopoulos, Graph Square Roots of Small Distance from Degree One Graphs. [Bibtex] Guilherme de C. M. Gomes, Matheus R. Guedes and Vinicius F. dos Santos, Structural Parameterizations for Equitable Coloring. [Bibtex] Marina Groshaus, André Luiz Pires Guedes and Fabricio Schiavon Kolberg, On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs. [Bibtex] Hiệp Hàn, Marcos Kiwi and Matías Pavez-Signé, Quasi-Random Words and Limits of Word Sequences. [Bibtex] Shunsuke Inenaga, Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. [Bibtex] Mincheol Kim, Sang Duk Yoon and Hee-Kap Ahn, Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain. [Bibtex] Tomasz Kociumaka, Gonzalo Navarro and Nicola Prezza, Towards a Definitive Measure of Repetitiveness. [Bibtex] Ioannis Mantas, Evanthia Papadopoulou, Vera Sacristán and Rodrigo I. Silveira, Farthest Color Voronoi Diagrams: Complexity and Algorithms. [Bibtex] Thiago Marcilon, Nícolas A. Martins and Rudini Menezes Sampaio, Hardness of Variants of the Graph Coloring Game. [Bibtex] Ido Nachum and Amir Yehudayoff, On Symmetry and Initialization for Neural Networks. [Bibtex] Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki and Yuki Ubukata, . [Bibtex] Lehilton L. C. Pedrosa and Greis Y. O. Quesquén, Approximating Routing and Connectivity Problems with Multiple Distances. [Bibtex] Lehilton L. C. Pedrosa and Hugo Kooki Kasuya Rosado, A 2-Approximation for the \(k\)-Prize-Collecting Steiner Tree Problem. [Bibtex] Pablo Pérez-Lantero, Carlos Seara and Jorge Urrutia, Rectilinear Convex Hull of Points in 3D. [Bibtex] Md Lutfar Rahman and Thomas Watson, Tractable Unordered 3-CNF Games. [Bibtex] Andrew Read-McFarland and Daniel Stefankovic, The Hardness of Sampling Connected Subgraphs. [Bibtex] Benjamin Rossman, Thresholds in the Lattice of Subspaces of \(\mathbb{F}_q^n\). [Bibtex] Kazuya Shimizu and Ryuhei Mori, Exponential-Time Quantum Algorithms for Graph Coloring Problems. [Bibtex] |
[Home] [All LATIN Papers] [LATIN 2020] |