Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama and Antoine Vigneron, A Generalization of the Convex Kakeya Problem. [Bibtex] Eric Angel, Evripidis Bampis and Vincent Chau, Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. [Bibtex] Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell and Rodrigo I. Silveira, Bichromatic 2-Center of Pairs of Points. [Bibtex] Vikraman Arvind, Partha Mukhopadhyay and Prajakta Nimbhorkar, Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. [Bibtex] Rafael da Ponte Barbosa and Yoshiko Wakabayashi, A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem. [Bibtex] Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic and Peter Rossmanith, On the Advice Complexity of the Knapsack Problem. [Bibtex] Nicolas Boria, Jérôme Monnot and Vangelis Th. Paschos, Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. [Bibtex] Prosenjit Bose, Rolf Fagerberg, André van Renssen and Sander Verdonschot, On Plane Constrained Bounded-Degree Spanners. [Bibtex] Joshua Brody, Hongyu Liang and Xiaoming Sun, Space-Efficient Approximation Scheme for Circular Earth Mover Distance. [Bibtex] Ana Busic, Nazim Fatès, Jean Mairesse and Irene Marcovici, Density Classification on Infinite Lattices and Trees. [Bibtex] Jean Cardinal and Matias Korman, Coloring Planar Homothets and Three-Dimensional Hypergraphs. [Bibtex] Armando Castañeda, Maurice Herlihy and Sergio Rajsbaum, An Equivariance Theorem with Applications to Renaming. [Bibtex] Armando Castañeda, Damien Imbs, Sergio Rajsbaum and Michel Raynal, Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. [Bibtex] Eda Cesaratto and Brigitte Vallée, Pseudorandomness of a Random Kronecker Sequence. [Bibtex] Richard Cole and Vijaya Ramachandran, Revisiting the Cache Miss Analysis of Multithreaded Algorithms. [Bibtex] Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman and Saket Saurabh, Parameterized Complexity of MaxSat above Average. [Bibtex] Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk and Jakub Onufry Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster Than \(2^n\). [Bibtex] Daniel Dadush, A \(O(1/\epsilon^2)^n\)-Time Sieving Algorithm for Approximate Integer Programming. [Bibtex] Pooya Davoodi, Michiel H. M. Smid and Freek van Walderveen, Two-Dimensional Range Diameter Queries. [Bibtex] Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl and Andrzej Ruciński, An Improved Upper Bound on the Density of Universal Random Graphs. [Bibtex] Volker Diekert, Jonathan Kausch and Markus Lohrey, Logspace Computations in Graph Groups and Coxeter Groups. [Bibtex] Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce and Ladislav Stacho, Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. [Bibtex] Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter and Alexandre Toma, On the Radon Number for \(P_3\)-Convexity. [Bibtex] Tinaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof and Daniel Meister, Computing Minimum Geodetic Sets of Proper Interval Graphs. [Bibtex] Zoltán Ésik and Szabolcs Iván, Hausdorff Rank of Scattered Context-Free Linear Orders. [Bibtex] Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro and Shmuel Zaks, . [Bibtex] MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni and Sina Sadeghian Sadeghabad, On the Non-progressive Spread of Influence through Social Networks. [Bibtex] Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela and Niko Välimäki, Forbidden Patterns. [Bibtex] Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner and Maximilian Witek, Structural Complexity of Multiobjective NP Search Problems. [Bibtex] Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle and Yngve Villanger, \(k\)-Gap Interval Graphs. [Bibtex] Pierre Fraigniaud and Andrzej Pelc, Decidability Classes for Mobile Agents Computing. [Bibtex] Bin Fu, NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets. [Bibtex] Martin Fürer, Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. [Bibtex] Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela and Jorma Tarhio, Indexed Multi-pattern Matching. [Bibtex] Archontia C. Giannopoulou, Sudeshna Kolay and Saket Saurabh, New Lower Bound on Max Cut of Hypergraphs with an Application to \(r\)-Set Splitting. [Bibtex] Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman and Ravi Sundaram, Cache Me If You Can: Capacitated Selfish Replication Games. [Bibtex] Gero Greiner and Riko Jacob, The Efficiency of MapReduce in Parallel External Memory. [Bibtex] Michel Habib, Antoine Mamcarz and Fabien de Montgolfier, Algorithms for Some \(H\)-Join Decompositions. [Bibtex] Daniel Heldt, Kolja B. Knauer and Torsten Ueckerdt, On the Bend-Number of Planar and Outerplanar Graphs. [Bibtex] Ahmed Helmi, Conrado Martínez and Alois Panholzer, Hiring above the \(m\)-th Best Candidate: A Generalization of Records in Permutations. [Bibtex] Wiebke Höhn and Tobias Jacobs, On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost. [Bibtex] Rohit Khandekar, Guy Kortsarz and Vahab S. Mirrokni, Advantage of Overlapping Clusters for Minimizing Conductance. [Bibtex] Toryn Qwyllyn Klassen and Philipp Woelfel, Independence of Tabulation-Based Hash Classes. [Bibtex] Martin Kutrib, Andreas Malcher and Giovanni Pighizzini, Oblivious Two-Way Finite Automata: Decidability and Complexity. [Bibtex] Hélio B. Macêdo Filho, Raphael C. S. Machado and Celina M. H. de Figueiredo, Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. [Bibtex] Bernard Mans and Igor Shparlinski, Random Walks and Bisections in Random Circulant Graphs. [Bibtex] Monaldo Mastrolilli, The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. [Bibtex] Basile Morcrette, Fully Analyzing an Algebraic Pólya Urn Model. [Bibtex] Zeev Nutov, Degree-Constrained Node-Connectivity. [Bibtex] Zeev Nutov, Survivable Network Activation Problems. [Bibtex] Jiawei Qian, Frans Schalekamp, David P. Williamson and Anke van Zuylen, On the Integrality Gap of the Subtour LP for the 1,2-TSP. [Bibtex] Hadas Shachnai, Gal Tamir and Tami Tamir, A Theory and Algorithms for Combinatorial Reoptimization. [Bibtex] Amir Shpilka, Capacity Achieving Two-Write WOM Codes. [Bibtex] Xiaoming Sun, Chengu Wang and Wei Yu, The Relationship between Inner Product and Counting Cycles. [Bibtex] Linqing Tang and Peng Zhang, Approximating Minimum Label \(s\)-\(t\) Cut via Linear Programming. [Bibtex]

[Home] [All LATIN Papers] [LATIN 2012]