33. MFCS 2008:
Torun,
Poland
Edward Ochmanski, Jerzy Tyszkiewicz (Eds.):
Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings.
Lecture Notes in Computer Science 5162 Springer 2008, ISBN 978-3-540-85237-7 BibTeX
Invited Papers
Contributed Papers
- Sarmad Abbasi, Numan Sheikh:
Question/Answer Games on Towers and Pyramids.
83-95
Electronic Edition (link) BibTeX
- Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy Malyshev, Martin Milanic:
The Maximum Independent Set Problem in Planar Graphs.
96-107
Electronic Edition (link) BibTeX
- Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When Ignorance Helps: Graphical Multicast Cost Sharing Games.
108-119
Electronic Edition (link) BibTeX
- Marek Tomasz Biskup:
Shortest Synchronizing Strings for Huffman Codes.
120-131
Electronic Edition (link) BibTeX
- Henrik Björklund, Wim Martens, Thomas Schwentick:
Optimizing Conjunctive Queries over Trees Using Schema Information.
132-143
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with Partial Information.
144-155
Electronic Edition (link) BibTeX
- Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the Metric Deadline TSP.
156-167
Electronic Edition (link) BibTeX
- Joan Boyar, Philip Matthews, René Peralta:
On the Shortest Linear Straight-Line Program for Computing Linear Forms.
168-179
Electronic Edition (link) BibTeX
- Mathieu Brévilliers, Nicolas Chevallier, Dominique Schmitt:
Flip Algorithm for Segment Triangulations.
180-192
Electronic Edition (link) BibTeX
- Hajo Broersma, Daniël Paulusma:
Computing Sharp 2-Factors in Claw-Free Graphs.
193-204
Electronic Edition (link) BibTeX
- Ioannis Caragiannis, Gianpiero Monaco:
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem.
205-216
Electronic Edition (link) BibTeX
- Arnaud Carayol, Michaela Slaats:
Positional Strategies for Higher-Order Pushdown Parity Games.
217-228
Electronic Edition (link) BibTeX
- Venkatesan T. Chakaravarthy, Sambuddha Roy:
Arthur and Merlin as Oracles.
229-240
Electronic Edition (link) BibTeX
- Emilie Charlier, Michel Rigo:
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems.
241-252
Electronic Edition (link) BibTeX
- Alessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella:
Regional Languages and Tiling: A Unifying Approach to Picture Grammars.
253-264
Electronic Edition (link) BibTeX
- Elena Czeizler, Lila Kari, Shinnosuke Seki:
On a Special Class of Primitive Words.
265-277
Electronic Edition (link) BibTeX
- Claire David:
Complexity of Data Tree Patterns over XML Documents.
278-289
Electronic Edition (link) BibTeX
- Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.
290-298
Electronic Edition (link) BibTeX
- Michael Elberfeld, Till Tantau:
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems.
299-310
Electronic Edition (link) BibTeX
- Gábor Erdélyi, Markus Nowak, Jörg Rothe:
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control.
311-322
Electronic Edition (link) BibTeX
- Alain Finkel, Arnaud Sangnier:
Reversal-Bounded Counter Machines Revisited.
323-334
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh:
Iterative Compression and Exact Algorithms.
335-346
Electronic Edition (link) BibTeX
- Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
Complexity and Limiting Ratio of Boolean Functions over Implication.
347-362
Electronic Edition (link) BibTeX
- Wouter Gelade:
Succinctness of Regular Expressions with Interleaving, Intersection and Counting.
363-374
Electronic Edition (link) BibTeX
- Pierre Guillon, Gaétan Richard:
Nilpotency and Limit Sets of Cellular Automata.
375-386
Electronic Edition (link) BibTeX
- Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
A Note on k-Colorability of P5-Free Graphs.
387-394
Electronic Edition (link) BibTeX
- Christian Hundt, Maciej Liskiewicz:
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations.
395-406
Electronic Edition (link) BibTeX
- Maurice J. Jansen:
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs.
407-418
Electronic Edition (link) BibTeX
- Jarkko Kari, Nicolas Ollinger:
Periodicity and Immortality in Reversible Computing.
419-430
Electronic Edition (link) BibTeX
- Marek Klonowski, Lukasz Krzywiecki, Miroslaw Kutylowski, Anna Lauks:
Step-Out Ring Signatures.
431-442
Electronic Edition (link) BibTeX
- Manfred Kufleitner:
The Height of Factorization Forests.
443-454
Electronic Edition (link) BibTeX
- Meena Mahajan, B. V. Raghavendra Rao:
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae.
455-466
Electronic Edition (link) BibTeX
- Bodo Manthey, Till Tantau:
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise.
467-478
Electronic Edition (link) BibTeX
- Giulio Manzonetto, Antonino Salibra:
From lambda-Calculus to Universal Algebra and Back.
479-490
Electronic Edition (link) BibTeX
- Radu Mardare, Alberto Policriti:
A Complete Axiomatic System for a Process-Based Spatial Logic.
491-502
Electronic Edition (link) BibTeX
- Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann:
Voronoi Games on Cycle Graphs.
503-514
Electronic Edition (link) BibTeX
- Andrew R. McGrae, Michele Zito:
Colouring Random Empire Trees.
515-526
Electronic Edition (link) BibTeX
- Andrei A. Muchnik, Andrei E. Romashchenko:
A Random Oracle Does Not Help Extract the Mutual Information.
527-538
Electronic Edition (link) BibTeX
- Kai Plociennik:
Approximating Independent Set and Coloring in Random Uniform Hypergraphs.
539-550
Electronic Edition (link) BibTeX
- Daniel Raible, Henning Fernau:
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.
551-562
Electronic Edition (link) BibTeX
- Damien Regnault:
Directed Percolation Arising in Stochastic Cellular Automata Analysis.
563-574
Electronic Edition (link) BibTeX
- Mark Rhodes:
Resolution Width and Cutting Plane Rank Are Incomparable.
575-587
Electronic Edition (link) BibTeX
- Jacques Sakarovitch, Rodrigo de Souza:
On the Decidability of Bounded Valuedness for Transducers.
588-600
Electronic Edition (link) BibTeX
- Stefan Szeider:
Monadic Second Order Logic on Graphs with Local Cardinality Constraints.
601-612
Electronic Edition (link) BibTeX
- Aleksander Wojdyga:
Short Proofs of Strong Normalization.
613-623
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:29:35 2009
by Michael Ley (ley@uni-trier.de)
