- Cristina G. Fernandes
, Carlos Eduardo Ferreira
, Christian Tjandraatmadja, Yoshiko Wakabayashi
:
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN 2008: 329-338 - Fedor V. Fomin
, Jan Kratochvíl
, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle:
On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205 - Martin Fürer
:
Solving NP-Complete Problems with Quantum Search. LATIN 2008: 784-792 - Joachim von zur Gathen, Igor E. Shparlinski
:
Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN 2008: 276-283 - Rodrigo González, Gonzalo Navarro:
Improved Dynamic Rank-Select Entropy-Bound Structures. LATIN 2008: 374-386 - Arvind Gupta, Pavol Hell, Mehdi Karimi
, Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN 2008: 182-193 - Anupam Gupta, Kunal Talwar:
How to Complete a Doubling Metric. LATIN 2008: 36-47 - Elad Hazan
:
Sparse Approximate Solutions to Semidefinite Programs. LATIN 2008: 306-316 - Pinar Heggernes
, Dieter Kratsch, Daniel Meister:
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN 2008: 216-227 - Pavol Hell, André Raspaud, Juraj Stacho:
On Injective Colourings of Chordal Graphs. LATIN 2008: 520-530 - Martin Hoefer:
Competitive Cost Sharing with Economies of Scale. LATIN 2008: 339-349 - Seok-Hee Hong, Hiroshi Nagamochi:
Approximating Crossing Minimization in Radial Layouts. LATIN 2008: 461-472 - Falk Hüffner
, Christian Komusiewicz
, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722 - Regant Y. S. Hung, Hing-Fung Ting:
Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream. LATIN 2008: 699-710 - Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
:
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. LATIN 2008: 94-105 - Yoshifumi Inui, François Le Gall:
Quantum Property Testing of Group Solvability. LATIN 2008: 772-783 - Gábor Ivanyos
, Luc Sanselme, Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. LATIN 2008: 759-771 - Raphaël M. Jungers, Vladimir Protasov
, Vincent D. Blondel:
Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices. LATIN 2008: 84-93 - George Karakostas
, Euripides Markou:
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes. LATIN 2008: 350-361 - Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems. LATIN 2008: 423-435 - Evangelos Kranakis
, Danny Krizanc, Pat Morin
:
Randomized Rendez-Vous with Limited Memory. LATIN 2008: 605-616 - Andrzej Lingas, Eva-Marta Lundell:
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. LATIN 2008: 736-746 - Mario Alberto López, Yan Mayster:
Weighted Rectilinear Approximation of Points in the Plane. LATIN 2008: 642-653 - Andreas Maletti:
Myhill-Nerode Theorem for Recognizable Tree Series Revisited. LATIN 2008: 106-120 - Conrado Martínez, Lucia Moura, Daniel Panario
, Brett Stevens:
Algorithms to Locate Errors Using Covering Arrays. LATIN 2008: 504-519 - Richard Matthew McCutchen
:
The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences. LATIN 2008: 593-604 - Yakov Nekrich:
I/O-Efficient Point Location in a Set of Rectangles. LATIN 2008: 687-698 - Zeev Nutov:
Approximating Steiner Networks with Node Weights. LATIN 2008: 411-422 - Rina Panigrahy:
An Improved Algorithm Finding Nearest Neighbor Using Kd-trees. LATIN 2008: 387-398 - GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski:
Profile of Tries. LATIN 2008: 1-11