Volume 63, Issue 3

July 2012

Special Issue: Theoretical Informatics

Issue Editor:

10 articles in this issue

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
Alejandro López-Ortiz
EditorialNotes 17 November 2011 Pages: 569 - 570
Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata
Viliam Geffert
Giovanni Pighizzini
OriginalPaper 08 December 2010 Pages: 571 - 587
The Complexity of Counting Eulerian Tours in 4-regular Graphs
Qi Ge
Daniel Štefankovič
OriginalPaper 22 October 2010 Pages: 588 - 601
Minimum-Perimeter Intersecting Polygons
Adrian Dumitrescu
Minghui Jiang
OriginalPaper 29 April 2011 Pages: 602 - 615
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
Mark van Hoeij
Andrew Novocin
OriginalPaper 01 March 2011 Pages: 616 - 633
The Power of Fair Pricing Mechanisms
Christine Chung
Katrina Ligett
Aaron Roth
OriginalPaper 18 November 2011 Pages: 634 - 644
Counting Hexagonal Patches and Independent Sets in Circle Graphs
Paul Bonsma
Felix Breuer
OriginalPaper 03 September 2011 Pages: 645 - 671
Optimal Polygonal Representation of Planar Graphs
C. A. Duncan
E. R. Gansner
S. G. Kobourov
OriginalPaper 11 May 2011 Pages: 672 - 691
Sharp Separation and Applications to Exact and Parameterized Algorithms
Fedor V. Fomin
Fabrizio Grandoni
Saket Saurabh
OriginalPaper 13 August 2011 Pages: 692 - 706
Lightweight Data Indexing and Compression in External Memory
Paolo Ferragina
Travis Gagie
Giovanni Manzini
OriginalPaper 18 June 2011 Pages: 707 - 730

Search