LATIN B

61 papers

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