FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science

Invited Papers.- Primality Testing with Gaussian Periods.- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple.- Encoding Generic Judgments.- Model Checking Algol-Like Languages Using Game Semantics.- Modeling Software: From Theory to Practice.- Contributed Papers.- Local Normal Forms for Logics over Traces.- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.- Communication Interference in Mobile Boxed Ambients.- The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity.- Composing Strand Spaces.- Generalising Automaticity to Modal Properties of Finite Structures.- An Automata-Theoretic Approach to Constraint LTL.- Hardness Results for Multicast Cost Sharing.- How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.- State Space Reductions for Alternating Buchi Automata Quotienting by Simulation Equivalences.- Algorithmic Combinatorics Based on Slicing Posets.- Pattern Matching for Arc-Annotated Sequences.- Knowledge over Dense Flows of Time (from a Hybrid Point of View).- The Complexity of the Inertia.- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures.- Deciding the First Level of the ?-Calculus Alternation Hierarchy.- Dynamic Message Sequence Charts.- The Complexity of Compositions of Deterministic Tree Transducers.- On the Hardness of Approximating Minimum Monopoly Problems.- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems.- Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic.- Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions.- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases.- Decomposition in Asynchronous Circuit Design.- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing.

[1]  W. Schnyder.  Planar graphs and poset dimension , 1989 .

[2]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[3]  Timo Poranen.  Anew Algorithm For Drawing Series-Parallel Graphs In 3D , 2000 .

[4]  Joost Engelfriet,et al.  Domino Treewidth , 1997, J. Algorithms.

[5]  Tao Lin,et al.  Three-Dimensional Graph Drawing , 1994, Graph Drawing.

[6]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[7]  C. E. Veni Madhavan,et al.  Stack and Queue Number of 2-Trees , 1995, COCOON.

[8]  J. Nesetril,et al.  Colorings and Homomorphisms of Minor Closed Classes , 2003 .

[9]  Bogdan Oporowski,et al.  On tree-partitions of graphs , 1996, Discret. Math..

[10]  Lenwood S. Heath,et al.  Laying out Graphs Using Queues , 1992, SIAM J. Comput..

[11]  Lenwood S. Heath,et al.  The pagenumber of k-trees is O(k) , 2001, Discret. Appl. Math..

[12]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[13]  Detlef Seese,et al.  Tree-partite graphs and the complexity of algorithms , 1985, FCT.

[14]  Henwood,et al.  Author index , 1983, Pharmacology Biochemistry and Behavior.

[15]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[16]  Stefan Felsner,et al.  Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions , 2001, J. Graph Algorithms Appl..

[17]  Bogdan Oporowski,et al.  Some results on tree decomposition of graphs , 1995, J. Graph Theory.

[18]  Andrea Sterbini,et al.  3D Straight-Line Grid Drawing of 4-Colorable Graphs , 1997, Inf. Process. Lett..

[19]  Rudolf Halin,et al.  Tree-partitions of infinite graphs , 1991, Discret. Math..

[20]  S. M. Malitz.  Graphs with E edges have pagenumber O(√E) , 1994, FOCS 1994.

[21]  Sriram Venkata Pemmarju.  Exploring the powers of stacks and queues via graph layouts , 1992 .

[22]  Bruce A. Reed,et al.  On Star Coloring of Graphs , 2001, WG.

[23]  Arnold L. Rosenberg,et al.  Comparing Queues and Stacks as Mechanisms for Laying out Graphs , 1992, SIAM J. Discret. Math..

[24]  David R. Wood,et al.  Tree-Partitions of k-Trees with Applications in Graph Layout , 2003, WG.

[25]  János Pach,et al.  Three-dimensional Grid Drawings of Graphs , 1997, GD.

[26]  Emilio Di Giacomo,et al.  Drawing series-parallel graphs on a box , 2002, CCCG.