GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème and Wojciech Szpankowski, Profile of Tries. [Bibtex]
Hervé Daudé and Vlady Ravelomanana, Random 2-{XORSAT} at the Satisfiability Threshold. [Bibtex] Ivan Rapaport, Karol Suchan, Ioan Todinca and Jacques Verstraëte, On Dissemination Thresholds in Regular and Irregular Graph Classes. [Bibtex] Anupam Gupta and Kunal Talwar, How to Complete a Doubling Metric. [Bibtex] Stanislav Angelov, Keshav Kunal and Andrew McGregor, Sorting and Selection with Random Costs. [Bibtex] Dominik Scheder, Guided Search and a Faster Deterministic Algorithm for 3-{SAT}. [Bibtex] Mukul S. Bansal, Jianrong Dong and David Fernández-Baca, Comparing and Aggregating Partially Resolved Trees. [Bibtex] Raphael M. Jungers, Vladimir Protasov and Vincent D. Blondel, Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices. [Bibtex] Oscar H. Ibarra, Juhani Karhumäki and Alexander Okhotin, On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. [Bibtex] Andreas Maletti, Myhill-Nerode Theorem for Recognizable Tree Series Revisited. [Bibtex] Sergey Afonin, The View Selection Problem for Regular Path Queries. [Bibtex] Rodrigo I. Silveira and Marc J. van Kreveld, Optimal Higher Order Delaunay Triangulations of Polygons. [Bibtex] Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman and Shakhar Smorodinsky, Coloring Geometric Range Spaces. [Bibtex] Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, H. González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny and Jorge Urrutia, Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. [Bibtex] Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin and Michiel H. M. Smid, Spanners of Complete $k$-Partite Geometric Graphs. [Bibtex] Arvind Gupta, Pavol Hell, Mehdi Karimi and Arash Rafiey, Minimum Cost Homomorphisms to Reflexive Digraphs. [Bibtex] Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini and Jan Arne Telle, On the Complexity of Reconstructing $H$-free Graphs from Their Star Systems. [Bibtex] Bruce Reed and Zhentao Li, Optimization and Recognition for $K_5$-minor Free Graphs in Linear Time. [Bibtex] Pinar Heggernes, Dieter Kratsch and Daniel Meister, Bandwidth of Bipartite Permutation Graphs in Polynomial Time. [Bibtex] Christine Chung, Kirk Pruhs and Patchrawat Uthaisombut, The Online Transportation Problem: On the Exponential Boost of One Extra Server. [Bibtex] Nikhil Bansal, David P. Bunde, Ho-Leung Chan and Kirk Pruhs, Average Rate Speed Scaling. [Bibtex] Marcin Bienkowski and Aleksander Madry, Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers. [Bibtex] Leah Epstein and Rob van Stee, Maximizing the Minimum Load for Selfish Agents. [Bibtex] Joachim von zur Gathen and Igor Shparlinski, Approximate Polynomial gcd: Small Degree and Small Height Perturbations. [Bibtex] Igor Shparlinski, Pseudorandom Graphs from Elliptic Curves. [Bibtex] Ali Akhavi and Damien Stehlé, Speeding-Up Lattice Reduction with Random Projections (Extended Abstract). [Bibtex] Elad Hazan, Sparse Approximate Solutions to Semidefinite Programs. [Bibtex] Gérard Cornuéjols and Fran&;ois Margot, On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. [Bibtex] Cristina G. Fernandes, Carlos Ferreira, Christian Tjandraatmadja and Yoshiko Wakabayashi, A Polyhedral Investigation of the {LCS} Problem and a Repetition-Free Variant. [Bibtex] Martin Hoefer, Competitive Cost Sharing with Economies of Scale. [Bibtex] George Karakostas and Euripides Markou, Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes. [Bibtex] Luís M. S. Russo, Gonzalo Navarro and Arlindo L. Oliveira, Fully-Compressed Suffix Trees. [Bibtex] Rodrigo González and Gonzalo Navarro, Improved Dynamic Rank-Select Entropy-Bound Structures. [Bibtex] Rina Panigrahy, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees. [Bibtex] Spyros Angelopoulos, Reza Dorrigiv and Alejandro López-Ortiz, List Update with Locality of Reference. [Bibtex] Zeev Nutov, Approximating Steiner Networks with Node Weights. [Bibtex] Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov and Elena Tsanko, Approximating Minimum-Power Degree and Connectivity Problems. [Bibtex] Amol Deshpande, Samir Khuller, Azarakhsh Malekian and Mohammed Toossi, Energy Efficient Monitoring in Sensor Networks. [Bibtex] Brian C. Dean, Adam Griffis and Adam Whitley, Approximation Algorithms for $k$-Hurdle Problems. [Bibtex] Seok-Hee Hong and Hiroshi Nagamochi, Approximating Crossing Minimization in Radial Layouts. [Bibtex] Andrzej Dudek and Vojtech Rödl, New Upper Bound on Vertex Folkman Numbers. [Bibtex] Andreas Brandstädt and Christian Hundt, Ptolemaic Graphs and Interval Graphs Are Leaf Powers. [Bibtex] Binh-Minh Bui-Xuan and Michel Habib, A Representation Theorem for Union-Difference Families and Application. [Bibtex] Conrado Martínez, Lucia Moura, Daniel Panario and Brett Stevens, Algorithms to Locate Errors Using Covering Arrays. [Bibtex] Pavol Hell, André Raspaud and Juraj Stacho, On Injective Colourings of Chordal Graphs. [Bibtex] Paul S. Bonsma and Florian Zickfeld, Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms. [Bibtex] Juraj Stacho, On 2-Subcolourings of Chordal Graphs. [Bibtex] Feodor F. Dragan, Chenyu Yan and Yang Xiang, Collective Additive Tree Spanners of Homogeneously Orderable Graphs. [Bibtex] Christine Cheng, The Generalized Median Stable Matchings: Finding Them Is Not That Easy. [Bibtex] Baruch Awerbuch and Rohit Khandekar, Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. [Bibtex] Richard McCutchen, The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences. [Bibtex] Evangelos Kranakis, Danny Krizanc and Pat Morin, Randomized Rendez-Vous with Limited Memory. [Bibtex] Marshall W. Bern and Barry Hayes, Origami Embedding of Piecewise-Linear Two-Manifolds. [Bibtex] Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang and Binhai Zhu, Simplifying {3D} Polygonal Chains Under the Discrete Fréchet Distance. [Bibtex] Mario Lopez and Yan Mayster, Weighted Rectilinear Approximation of Points in the Plane. [Bibtex] Imre Bárány, Attila Pór and Pavel Valtr, Paths with no Small Angles. [Bibtex] Domingos Dellamonica Jr., Simpler Constant-Seed Condensers. [Bibtex] Kooshiar Azimian and Mario Szegedy, Parallel Repetition of the Odd Cycle Game. [Bibtex] Yakov Nekrich, {I/O}-Efficient Point Location in a Set of Rectangles. [Bibtex] Regant Y. S. Hung and Hing-Fung Ting, Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream. [Bibtex] Falk Hüffner, Christian Komusiewicz, Hannes Moser and Rolf Niedermeier, Fixed-Parameter Algorithms for Cluster Vertex Deletion. [Bibtex] A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Yannis Manoussakis, Carlos Martinhon and Rachid Saad, Paths and Trails in Edge-Colored Graphs. [Bibtex] Andrzej Lingas and Eva-Marta Lundell, Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. [Bibtex] Thomas Erlebach and Erik Jan van Leeuwen, Domination in Geometric Intersection Graphs. [Bibtex] Gábor Ivanyos, Luc Sanselme and Miklos Santha, An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. [Bibtex] Yoshifumi Inui and Fran&;ois Le Gall, Quantum Property Testing of Group Solvability. [Bibtex] Martin Fürer, Solving {NP}-Complete Problems with Quantum Search. [Bibtex] |
[Home] [All LATIN Papers] [LATIN 2008] |