Cristopher Moore, Continuous and Discrete Methods in Computer Science. [Bibtex]
Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky and Perouz Taslakian, Colorful Strips. [Bibtex] Jonathan Backer and J. Mark Keil, The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. [Bibtex] Qianping Gu and Navid Imani, Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. [Bibtex] Eric Angel, Evripidis Bampis and Nicolas Thibault, Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. [Bibtex] Martin Fürer, Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. [Bibtex] Nadja Betzler, Jiong Guo, Christian Komusiewicz and Rolf Niedermeier, Average Parameterization and Partial Kernelization for Computing Medians. [Bibtex] Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni and Saket Saurabh, Sharp Separation and Applications to Exact and Parameterized Algorithms. [Bibtex] Tsunehiko Kameda, Ichiro Suzuki and John Z. Zhang, Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. [Bibtex] Salvatore La Torre, Parthasarathy Madhusudan and Gennaro Parlato, The Language Theory of Bounded Context-Switching. [Bibtex] Diego Recalde, Cyriel Rutten, Petra Schuurman and Tjark Vredeveld, Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. [Bibtex] Britta Peis, Martin Skutella and Andreas Wiese, Packet Routing on the Grid. [Bibtex] Michael D. Coury, Pavol Hell, Jan Kratochvíl and Tomás Vyskocil, Faithful Representations of Graphs by Islands in the Extended Grid. [Bibtex] Gero Greiner and Riko Jacob, The I/O Complexity of Sparse Matrix Dense Matrix Multiplication. [Bibtex] Piotr Indyk, Sparse Recovery Using Sparse Random Matrices. [Bibtex] Johannes Fischer, Optimal Succinctness for Range Minimum Queries. [Bibtex] Jérémy Barbay, Francisco Claude and Gonzalo Navarro, Compact Rich-Functional Binary Relation Representations. [Bibtex] Sylvain Lombardy and Jacques Sakarovitch, Radix Cross-Sections for Length Morphisms. [Bibtex] Viliam Geffert and Giovanni Pighizzini, Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. [Bibtex] Janusz A. Brzozowski, Galina Jirásková and Baiyu Li, Quotient Complexity of Ideal Languages. [Bibtex] Frédérique Bassino, Laura Giambruno and Cyril Nicaud, Complexity of Operations on Cofinite Languages. [Bibtex] Hagai Cohen and Ely Porat, Fast Set Intersection and Two-Patterns Matching. [Bibtex] Joachim von zur Gathen, Alfredo Viola and Konstantin Ziegler, Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. [Bibtex] Beate Bollig, A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. [Bibtex] Manfred G. Madritsch and Brigitte Vallée, Modelling the LLL Algorithm by Sandpiles. [Bibtex] Prosenjit Bose, Paz Carmi, Michiel H. M. Smid and Daming Xu, Communication-Efficient Construction of the Plane Localized Delaunay Graph. [Bibtex] Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid and Hanjo Täubig, Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. [Bibtex] Petra Berenbrink, Robert Elsässer and Thomas Sauerwald, Randomised Broadcasting: Memory vs. Randomness. [Bibtex] Vonjy Rasendrahasina and Vlady Ravelomanana, Limit Theorems for Random MAX-2-XORSAT. [Bibtex] Per Austrin, Siavosh Benabbas and Avner Magen, On Quadratic Threshold CSPs. [Bibtex] Carles Padró and Leonor Vázquez, Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. [Bibtex] Elizabeth Maltais and Lucia Moura, Finding the Best CAFE Is NP-Hard. [Bibtex] Anna Gál and Jing-Tang Jang, The Size and Depth of Layered Boolean Circuits. [Bibtex] Pankaj K. Agarwal, Jeff M. Phillips and Bardia Sadri, Lipschitz Unimodal and Isotonic Regression on Paths and Trees. [Bibtex] Daniel Panario, Brett Stevens and Qiang Wang, Ambiguity and Deficiency in Costas Arrays and APN Permutations. [Bibtex] Sergio Rajsbaum, Iterated Shared Memory Models. [Bibtex] Emden R. Gansner, Yifan Hu, Michael Kaufmann and Stephen G. Kobourov, Optimal Polygonal Representation of Planar Graphs. [Bibtex] Adrian Dumitrescu and Minghui Jiang, Minimum-Perimeter Intersecting Polygons. [Bibtex] Qi Cheng and Yu-Hsin Li, Finding the Smallest Gap between Sums of Square Roots. [Bibtex] Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara and Perouz Taslakian, Matching Points with Things. [Bibtex] Bettina Speckmann and Kevin Verbeek, Homotopic Rectilinear Routing with Few Links and Thick Edges. [Bibtex] Alexis Ballier, Bruno Durand and Emmanuel Jeandel, Tilings Robust to Errors. [Bibtex] Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia and Carola Wenk, Visiting a Sequence of Points with a Bevel-Tip Needle. [Bibtex] MohammadHossein Bateni and MohammadTaghi Hajiaghayi, Euclidean Prize-Collecting Steiner Forest. [Bibtex] MohammadTaghi Hajiaghayi and Arefeh A. Nasri, Prize-Collecting Steiner Networks via Iterative Rounding. [Bibtex] René van Bevern, Hannes Moser and Rolf Niedermeier, Kernelization through Tidying. [Bibtex] Mark van Hoeij and Andrew Novocin, Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. [Bibtex] Christine Chung, Katrina Ligett, Kirk Pruhs and Aaron Roth, The Power of Fair Pricing Mechanisms. [Bibtex] Vahab S. Mirrokni, S. Muthukrishnan and Uri Nadav, Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. [Bibtex] Leslie G. Valiant, Some Observations on Holographic Algorithms. [Bibtex] Jaroslaw Byrka, Andreas Karrenbauer and Laura Sanità, The Interval Constrained 3-Coloring Problem. [Bibtex] Paul S. Bonsma and Felix Breuer, Counting Hexagonal Patches and Independent Sets in Circle Graphs. [Bibtex] Yuichi Asahiro, Eiji Miyano and Kazuaki Samizo, Approximating Maximum Diameter-Bounded Subgraphs. [Bibtex] Kunal Dutta and C. R. Subramanian, Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. [Bibtex] Qi Ge and Daniel Stefankovic, The Complexity of Counting Eulerian Tours in 4-Regular Graphs. [Bibtex] Andreas Brandstädt, Christian Hundt and Ragnar Nevries, Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. [Bibtex] Marek Karpinski, Andrzej Rucinski and Edyta Szymanska, Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. [Bibtex] Amalia Duch, Rosa M. Jiménez and Conrado Martínez, Rank Selection in Multidimensional Data. [Bibtex] Prosenjit Bose, Karim Douïeb, Vida Dujmovic and John Howat, Layered Working-Set Trees. [Bibtex] Paolo Ferragina, Travis Gagie and Giovanni Manzini, Lightweight Data Indexing and Compression in External Memory. [Bibtex] |
[Home] [All LATIN Papers] [LATIN 2010] |