37. MFCS 2012:
Bratislava, Slovakia
Nicole Schweikardt:
A Toolkit for Proving Limitations of the Expressive Power of Logics.
46-47
Tatsuya Akutsu,
Takeyuki Tamura:
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree.
76-87
Paul Bonsma:
The Complexity of Rerouting Shortest Paths.
222-233
Gabriele Fici:
A Characterization of Bispecial Sturmian Words.
383-394
Torben Hagerup:
Kernels for Edge Dominating Set: Simpler or Smaller.
491-502
David Janin:
Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract).
516-528
Tommi Lehtinen:
Equations X + A = B and (X + X) + C = (X - X) + D over Sets of Natural Numbers.
615-629
Anthony Widjaja Lin:
Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs).
630-642
Thomas Weidner:
Probabilistic Automata and Probabilistic Logic.
813-824
Mingyu Xiao,
Jiong Guo:
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments.
825-835
data released under the ODC-BY 1.0 license
