On the public citation graph
Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004 : proceedings
0 signed · 79 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.016openalex-snapshot
A generalization of repetition threshold
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11429647_10openalex-snapshot
Distributed Exploration of an Unknown Graph
inferred← citeshttps://doi.org/10.1007/11429647_12openalex-snapshot
Finding Short Right-Hand-on-the-Wall Walks in Graphs
inferred← citeshttps://doi.org/10.1007/11429647_13openalex-snapshot
Space Lower Bounds for Graph Exploration via Reduced Automata
inferred← citeshttps://doi.org/10.1007/11494645_53openalex-snapshot
Some Reducibilities on Regular Sets
inferred← citeshttps://doi.org/10.1007/11505877_13openalex-snapshot
On the Membership of Invertible Diagonal Matrices
inferred← citeshttps://doi.org/10.1007/11518655_58openalex-snapshot
Query Answering in Normal Logic Programs Under Uncertainty
inferred← citeshttps://doi.org/10.1007/11523468_80openalex-snapshot
Lower Bounds for Circuits with Few Modular and Symmetric Gates
inferred← citeshttps://doi.org/10.1007/11533719_37openalex-snapshot
Solovay Reducibility on D-c.e Real Numbers
inferred← citeshttps://doi.org/10.1007/11534273_15openalex-snapshot
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
inferred← citeshttps://doi.org/10.1007/11534273_5openalex-snapshot
Parameterized Complexity of Generalized Vertex Cover Problems
inferred← citeshttps://doi.org/10.1007/11539452_33openalex-snapshot
Games Where You Can Play Optimally Without Any Memory
inferred← citeshttps://doi.org/10.1007/11549345_54openalex-snapshot
Tight Approximability Results for the Maximum Solution Equation Problem over Z p
inferred← citeshttps://doi.org/10.1007/11561071_8openalex-snapshot
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,
inferred← citeshttps://doi.org/10.1007/11580850_6openalex-snapshot
Types for Security in a Mobile World
inferred← citeshttps://doi.org/10.1007/11600930_20openalex-snapshot
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling
inferred← citeshttps://doi.org/10.1007/11601548_20openalex-snapshot
A Mobility Calculus with Local and Dependent Types
inferred← citeshttps://doi.org/10.1007/11602613_17openalex-snapshot
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
inferred← citeshttps://doi.org/10.1007/11685654_1openalex-snapshot
The Reduced Automata Technique for Graph Exploration Space Lower Bounds
inferred← citeshttps://doi.org/10.1007/11861201_18openalex-snapshot
Simulation of d′-Dimensional Cellular Automata on d-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_34openalex-snapshot
Solving Parity Games on the GPU
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_6openalex-snapshot
A Modified Completeness Theorem of KAT and Decidability of Term Reducibility
inferred← citeshttps://doi.org/10.1007/978-3-319-08494-7_1openalex-snapshot
Concurrency and Reversibility
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_15openalex-snapshot
A Structural View on Parameterizing Problems: Distance from Triviality
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_35openalex-snapshot
Error Compensation in Leaf Root Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_5openalex-snapshot
Which XML Schemas Admit 1-Pass Preorder Typing?
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_10openalex-snapshot
How Common Can Be Universality for Cellular Automata?
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_18openalex-snapshot
Persistent Computations of Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_18openalex-snapshot
Pure Stationary Optimal Strategies in Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_23openalex-snapshot
The Java Memory Model: Operationally, Denotationally, Axiomatically
inferred← citeshttps://doi.org/10.1007/978-3-540-75288-2_4openalex-snapshot
Fast Answering of XPath Query Workloads on Web Collections
inferred← citeshttps://doi.org/10.1007/978-3-540-75288-2_8openalex-snapshot
XML Schema Evolution: Incremental Validation and Efficient Document Adaptation
inferred← citeshttps://doi.org/10.1007/978-3-540-76631-5_26openalex-snapshot
On Reachability of Minimal Models of Multilattice-Based Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_34openalex-snapshot
Mortality Problem for 2×2 Integer Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-85658-0_2openalex-snapshot
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_7openalex-snapshot
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_31openalex-snapshot
Quantified Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_53openalex-snapshot
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_57openalex-snapshot
A New Family of Regular Operators Fitting with the Position Automaton Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_24openalex-snapshot
Games through Nested Fixpoints
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_1openalex-snapshot
A Survey of Stochastic Games with Limsup and Liminf Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-03793-1_4openalex-snapshot
XML Security Views Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_2openalex-snapshot
Kernelization: New Upper and Lower Bound Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-14729-6_6openalex-snapshot
Formal Parameters of Phonology
inferred← citeshttps://doi.org/10.1007/978-3-642-14808-8_4openalex-snapshot
Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-14808-8_5openalex-snapshot
Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_22openalex-snapshot
Self-organization in Cellular Automata: A Particle-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-22600-7_19openalex-snapshot
Kleene Theorems for Product Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_54openalex-snapshot
Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_31openalex-snapshot
Fast Sub-exponential Algorithms and Compactness in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24471-1_4openalex-snapshot
On a Non-monotonicity Effect of Similarity Measures
inferred← citeshttps://doi.org/10.1007/978-3-642-31131-4_11openalex-snapshot
Maximal Confluent Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_7openalex-snapshot
Weak Inclusion for Recursive XML Types
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_9openalex-snapshot
Unordered Constraint Satisfaction Games
inferred← citeshttps://doi.org/10.1007/978-3-642-38986-3_12openalex-snapshot
Modelling of Bonding with Processes and Events
inferred← citeshttps://doi.org/10.1007/s10796-012-9375-8openalex-snapshot
Efficient adaptation of XML data using a conceptual model
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.023openalex-snapshot
Graph multi-coloring for a job scheduling application
inferred← citeshttps://doi.org/10.1016/j.dsp.2016.11.002openalex-snapshot
On detecting predictability of one-sided sequences
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105151openalex-snapshot
Solving mean-payoff games via quasi dominions
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.01.008openalex-snapshot
On the parameterized complexity of the Edge Monitoring problem
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2017.11.050openalex-snapshot
Root multiplicities for Borcherds algebras and graph coloring
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.11.004openalex-snapshot
Logics for unordered trees with data constraints
inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105492openalex-snapshot
Chromatic symmetric function of graphs from Borcherds algebras
inferred← citeshttps://doi.org/10.1016/j.jcta.2024.105862openalex-snapshot
A study on free roots of Borcherds-Kac-Moody Lie superalgebras
inferred← citeshttps://doi.org/10.1016/j.jda.2008.07.004openalex-snapshot
A bounded search tree algorithm for parameterized face cover
inferred← citeshttps://doi.org/10.1016/j.jss.2011.09.038openalex-snapshot
Evolution and change management of XML-based systems
inferred← citeshttps://doi.org/10.1016/j.orl.2019.04.004openalex-snapshot
Domino sequencing: Scheduling with state-based sequence-dependent setup times
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.001openalex-snapshot
On Dejean’s conjecture over large alphabets
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.021openalex-snapshot
Dynamical behavior of additive cellular automata over finite abelian groups
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115552openalex-snapshot
Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures
inferred← citeshttps://doi.org/10.1093/comjnl/bxac037openalex-snapshot
Learning Disjunctive Multiplicity Expressions and Disjunctive Generalize Multiplicity Expressions From Both Positive and Negative Examples
inferred← citeshttps://doi.org/10.1137/21m1414620openalex-snapshot
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
inferred← citeshttps://doi.org/10.1145/2539150.2539189openalex-snapshot
Methodology for Design and Evolution of XML Schemas using Conceptual Modeling
inferred← citeshttps://doi.org/10.1145/2746539.2746550openalex-snapshot
Inapproximability of Combinatorial Problems via Small LPs and SDPs
inferred← citeshttps://doi.org/10.5555/1496770.1496812openalex-snapshot
Inserting a vertex into a planar graph
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.