| Publication | Date of Publication | Type |
|---|
Space separating special Geffert normal form for succinct representation of star-controlled insertion-deletion systems
Acta Informatica | 2026-03-16 | Paper |
Enumerating minimal defensive alliances
Discrete Applied Mathematics | 2026-03-05 | Paper |
Offensive alliances in signed graphs
Theoretical Computer Science | 2026-02-04 | Paper |
| All paths lead to Rome | 2026-01-28 | Paper |
Non-simple rule counting in semi-conditional grammars
Theoretical Computer Science | 2025-12-15 | Paper |
| Matrix forbidding grammars | 2025-12-15 | Paper |
Parameterizing path partitions
Theoretical Computer Science | 2025-01-16 | Paper |
| Roman census: enumerating and counting Roman dominating functions on graph classes | 2024-12-03 | Paper |
| Offensive alliances in signed graphs | 2024-11-12 | Paper |
| Advocating ownership | 2024-07-05 | Paper |
Minimal Roman dominating functions: extensions and enumeration
Algorithmica | 2024-05-30 | Paper |
| The synchronization game on subclasses of automata | 2024-05-16 | Paper |
| Unlabeled multi-robot motion planning with tighter separation bounds | 2024-05-14 | Paper |
On the computational completeness of generalized forbidding matrix grammars
Theoretical Computer Science | 2024-05-06 | Paper |
When Stars Control a Grammar's Work
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Profit parameterizations of \textsc{Dominating Set}
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
Natural Computing | 2024-02-09 | Paper |
On the complexity of intersection non-emptiness for star-free language classes
(available as arXiv preprint) | 2024-02-05 | Paper |
Synchronizing deterministic push-down automata can be really hard
Information and Computation | 2024-02-02 | Paper |
| Offensive Alliances in Signed Graphs | 2023-12-19 | Paper |
Investigations on the power of matrix insertion-deletion systems with small sizes
Natural Computing | 2023-11-30 | Paper |
| Insertion-deletion with substitutions. II: About the role of one-sided context | 2023-11-23 | Paper |
The space complexity of sum labelling
Theory of Computing Systems | 2023-10-30 | Paper |
Recognizing well-dominated graphs is coNP-complete
Information Processing Letters | 2023-10-12 | Paper |
Parameterizing path partitions
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Order Reconfiguration under Width Constraints
Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
Extension of some edge graph problems: standard, parameterized and approximation complexity
Discrete Applied Mathematics | 2023-09-14 | Paper |
| Perfect Roman Domination and Unique Response Roman Domination | 2023-09-13 | Paper |
On the generative capacity of matrix insertion-deletion systems of small sum-norm
Natural Computing | 2023-09-08 | Paper |
| Order Reconfiguration Under Width Constraints. | 2023-08-08 | Paper |
Combinatorial properties and recognition of unit square visibility graphs
Discrete & Computational Geometry | 2023-05-12 | Paper |
Minimal Roman dominating functions: extensions and enumeration
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Preface of the special issue dedicated to selected papers from CSR 2020
Theory of Computing Systems | 2023-05-02 | Paper |
| Invited talks | 2023-03-22 | Paper |
| Sum Labelling Graphs of Maximum Degree Two | 2023-01-05 | Paper |
| Synchronizing words and monoid factorization: a parameterized perspective | 2022-12-22 | Paper |
| Insertion-deletion systems with substitutions. I | 2022-12-16 | Paper |
VALENCE GRAMMARS WITH TARGET SETS
Words, Semigroups, and Transductions | 2022-12-06 | Paper |
Pattern matching with variables: efficient algorithms and complexity results
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
Mathematical Structures in Computer Science | 2022-11-17 | Paper |
Properties of graphs specified by a regular language
Acta Informatica | 2022-08-30 | Paper |
Improved descriptional complexity results on generalized forbidding grammars
Discrete Applied Mathematics | 2022-08-04 | Paper |
| Semicomputable points in Euclidean spaces | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559404 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
The space complexity of sum labelling
(available as arXiv preprint) | 2022-05-20 | Paper |
Computer science -- theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 -- July 3, 2020. Proceedings
Lecture Notes in Computer Science | 2022-04-21 | Paper |
| Parsimonious computational completeness | 2022-03-25 | Paper |
Properties of graphs specified by a regular language
Developments in Language Theory | 2022-03-25 | Paper |
| Adding matrix control: insertion-deletion systems with substitutions. III | 2022-03-24 | Paper |
On the computational completeness of matrix simple semi-conditional grammars
Information and Computation | 2022-03-14 | Paper |
Insertion-deletion systems with substitutions. I
Computability | 2022-02-28 | Paper |
On the complexity of solution extension of optimization problems
Theoretical Computer Science | 2022-02-01 | Paper |
Synchronizing series-parallel deterministic finite automata with loops and related problems
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
| Generalized forbidding matrix grammars and their membrane computing perspective | 2021-12-01 | Paper |
Self-verifying pushdown and queue automata
Fundamenta Informaticae | 2021-11-15 | Paper |
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
Fundamenta Informaticae | 2021-10-25 | Paper |
| On the power of generalized forbidding insertion-deletion systems | 2021-07-14 | Paper |
| Insertion-deletion with substitutions. II | 2021-07-14 | Paper |
On the complexity of the smallest grammar problem over fixed alphabets
Theory of Computing Systems | 2021-06-24 | Paper |
Algorithmic aspects of upper edge domination
Theoretical Computer Science | 2021-06-23 | Paper |
| Cooperating distributed grammar systems of finite index working in hybrid modes | 2021-06-22 | Paper |
Cooperating distributed grammar systems of finite index working in hybrid modes
(available as arXiv preprint) | 2021-06-22 | Paper |
Aspects of upper defensive alliances
Discrete Applied Mathematics | 2021-05-19 | Paper |
| On matrix ins-del systems of small sum-norm | 2020-10-22 | Paper |
Universal insertion grammars of size two
Theoretical Computer Science | 2020-10-13 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
Computability | 2020-09-08 | Paper |
Parameterized dynamic variants of red-blue dominating set
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Combinatorial properties and recognition of unit square visibility graphs
(available as arXiv preprint) | 2020-05-26 | Paper |
Domination chain: characterisation, classical complexity, parameterised complexity and approximability
Discrete Applied Mathematics | 2020-05-18 | Paper |
| Descriptional complexity of matrix simple semi-conditional grammars | 2020-05-12 | Paper |
| Regulated tree automata | 2020-05-12 | Paper |
Extension of Vertex Cover and Independent Set in some classes of graphs
(available as arXiv preprint) | 2020-02-06 | Paper |
| Extension of Vertex Cover and Independent Set in some classes of graphs | 2020-02-06 | Paper |
| Extension of some edge graph problems: standard and parameterized complexity | 2020-01-30 | Paper |
| Extensions to minimal synchronizing words | 2020-01-15 | Paper |
Complexity of independency and cliquy trees
Discrete Applied Mathematics | 2019-12-30 | Paper |
| Modern aspects of complexity within formal languages | 2019-12-04 | Paper |
Improved descriptional complexity results on generalized forbidding grammars
Algorithms and Discrete Applied Mathematics | 2019-10-10 | Paper |
Valuations and unambiguity of languages, with applications to fractal geometry
Automata, Languages and Programming | 2019-04-29 | Paper |
| Properties of language classes between linear and context-free | 2019-02-18 | Paper |
On path-controlled insertion-deletion systems
Acta Informatica | 2019-01-25 | Paper |
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
RAIRO - Theoretical Informatics and Applications | 2018-11-01 | Paper |
| Computational completeness of simple semi-conditional insertion-deletion systems | 2018-10-18 | Paper |
| New nonterminal complexity results for semi-conditional grammars | 2018-09-06 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
(available as arXiv preprint) | 2018-09-06 | Paper |
Problems on finite automata and the exponential time hypothesis
Algorithms | 2018-08-20 | Paper |
The complexity of probabilistic lobbying
Discrete Optimization | 2018-08-17 | Paper |
Clustering with lower-bounded sizes. A general graph-theoretic framework
Algorithmica | 2018-07-26 | Paper |
| Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case | 2018-06-26 | Paper |
| Extremal kernelization: a commemorative paper | 2018-06-15 | Paper |
Revisiting Shinohara's algorithm for computing descriptive patterns
Theoretical Computer Science | 2018-06-05 | Paper |
Simple picture processing based on finite automata and regular grammars
Journal of Computer and System Sciences | 2018-05-08 | Paper |
| scientific article; zbMATH DE number 6861937 (Why is no real title available?) | 2018-04-19 | Paper |
| On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes | 2018-03-29 | Paper |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
Non-isometric contextual array grammars and the role of regular control and local selectors
Fundamenta Informaticae | 2018-01-19 | Paper |
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
Discrete Applied Mathematics | 2018-01-11 | Paper |
| On the complexity of grammar-based compression over fixed alphabets | 2017-12-19 | Paper |
| Universal matrix insertion grammars with small size | 2017-08-31 | Paper |
| Graph-controlled insertion-deletion systems generating language classes beyond linearity | 2017-08-31 | Paper |
| Computational completeness of path-structured graph-controlled insertion-deletion systems | 2017-08-22 | Paper |
Characterization and complexity results on jumping finite automata
Theoretical Computer Science | 2017-06-19 | Paper |
Contextual array grammars with matrix control, regular control languages, and tissue P systems control
Theoretical Computer Science | 2017-06-15 | Paper |
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
Theoretical Computer Science | 2017-06-15 | Paper |
Parikh images of matrix ins-del systems
Lecture Notes in Computer Science | 2017-05-19 | Paper |
The differential and the roman domination number of a graph
Applicable Analysis and Discrete Mathematics | 2017-03-14 | Paper |
| On the parameterised complexity of string morphism problems | 2017-02-21 | Paper |
Learning Tree Languages
Topics in Grammatical Inference | 2017-02-15 | Paper |
| Pattern matching with variables: fast algorithms and new hardness results | 2017-01-24 | Paper |
| An essay on general grammars | 2016-12-20 | Paper |
Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Problems on finite automata and the exponential time hypothesis
Implementation and Application of Automata | 2016-11-09 | Paper |
Descriptional complexity of graph-controlled insertion-deletion systems
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Contextual array grammars with matrix and regular control
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Using parametric transformations toward polynomial kernels for packing problems allowing overlaps
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Upper domination: complexity and approximation
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Generative power of matrix insertion-deletion systems with context-free insertion or deletion
Unconventional Computation and Natural Computation | 2016-09-28 | Paper |
On the parameterised complexity of string morphism problems
Theory of Computing Systems | 2016-09-21 | Paper |
Global powerful \(r\)-alliances and total \(k\)-domination in graphs
Utilitas Mathematica | 2016-06-10 | Paper |
The finite index restriction meets hybrid modes in cooperating distributed grammar systems
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
On the complexity landscape of the domination chain
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Scanning pictures the boustrophedon way
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Weak total resolvability in graphs
Discussiones Mathematicae Graph Theory | 2016-01-26 | Paper |
Data reductions and combinatorial bounds for improved approximation algorithms
Journal of Computer and System Sciences | 2015-12-30 | Paper |
Polynomial inference of universal automata from membership and equivalence queries
Information and Computation | 2015-12-28 | Paper |
On the partition dimension of unicyclic graphs
(available as arXiv preprint) | 2015-11-09 | Paper |
Contextual array grammars and array P systems
Annals of Mathematics and Artificial Intelligence | 2015-10-06 | Paper |
Kernelization algorithms for packing problems allowing overlaps
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Jumping finite automata: characterizations and complexity
Implementation and Application of Automata | 2015-09-23 | Paper |
Non-isometric contextual array grammars with regular control and local selectors
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Approximation algorithms inspired by kernelization methods
Algorithms and Computation | 2015-09-11 | Paper |
Computing the metric dimension for chain graphs
Information Processing Letters | 2015-06-02 | Paper |
Pattern matching with variables: a multivariate complexity analysis
Information and Computation | 2015-06-01 | Paper |
On the leftmost derviation in matrix grammars
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
A survey on alliances and related parameters in graphs
Electronic Journal of Graph Theory and Applications | 2015-03-05 | Paper |
A multi-parameter analysis of hard problems on deterministic finite automata
Journal of Computer and System Sciences | 2015-02-20 | Paper |
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
Theoretical Computer Science | 2014-12-22 | Paper |
Combinatorics for smaller kernels: the differential of a graph
Theoretical Computer Science | 2014-12-02 | Paper |
Kernel(s) for problems with no kernel
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Saving on phases: parameterized approximation for total vertex cover
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Notions of metric dimension of corona products: combinatorial and computational results
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Computing the differential of a graph: hardness, approximability and exact algorithms
Discrete Applied Mathematics | 2014-05-05 | Paper |
| An amortized search tree analysis for finding a \(k\)-leaf spanning tree in an undirected graph | 2014-05-02 | Paper |
Packing paths: recycling saves time
Discrete Applied Mathematics | 2014-04-16 | Paper |
Digraphs of bounded elimination width
Discrete Applied Mathematics | 2014-04-02 | Paper |
A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
Theoretical Computer Science | 2014-01-13 | Paper |
Array insertion and deletion P systems
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Pattern Matching with Variables: A Multivariate Complexity Analysis
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Exact exponential-time algorithms for finding bicliques
Information Processing Letters | 2013-04-04 | Paper |
A multivariate analysis of some DFA problems
Language and Automata Theory and Applications | 2013-03-18 | Paper |
MAT learning of universal automata
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
Algorithmica | 2013-03-05 | Paper |
Parameterized measure \& conquer for problems with no small kernels
Algorithmica | 2012-11-21 | Paper |
Cooperating Distributed Tree Automata
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Lower bounds on the differential of a graph
Discrete Mathematics | 2012-10-26 | Paper |
| An optimal construction of finite automata from regular expressions | 2012-10-19 | Paper |
Charge and reduce: A fixed-parameter algorithm for string-to-string correction
Discrete Optimization | 2012-10-16 | Paper |
On families of categorial grammars of bounded value, their learnability and related complexity questions
Theoretical Computer Science | 2012-10-11 | Paper |
An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Kernels for Packing and Covering Problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Parameterized approximation algorithms for hitting set
Approximation and Online Algorithms | 2012-07-16 | Paper |
Constraint bipartite vertex cover: simpler exact algorithms and implementations
Journal of Combinatorial Optimization | 2012-07-03 | Paper |
An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
Algorithmica | 2012-04-26 | Paper |
| \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves | 2012-04-24 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Theoretical Computer Science | 2012-01-09 | Paper |
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Facility location problems: a parameterized view
Discrete Applied Mathematics | 2011-08-10 | Paper |
On the expressive power of valences in cooperating distributed grammar systems
Computation, Cooperation, and Life | 2011-06-24 | Paper |
Ranking and drawing in subexponential time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
A new upper bound for Max-2-SAT: A graph-theoretic approach
Journal of Discrete Algorithms | 2011-01-20 | Paper |
Parameterized algorithmics for \(d\)-HITTING SET
International Journal of Computer Mathematics | 2011-01-20 | Paper |
Combining Two Worlds: Parameterised Approximation for Vertex Cover
Algorithms and Computation | 2010-12-09 | Paper |
Enumerate and measure: improving parameter budget management
Parameterized and Exact Computation | 2010-12-07 | Paper |
Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG
Grammatical Inference: Theoretical Results and Applications | 2010-09-10 | Paper |
Comparing trees via crossing minimization
Journal of Computer and System Sciences | 2010-08-18 | Paper |
The curse of connectivity: \(t\)-total vertex (edge) cover
Lecture Notes in Computer Science | 2010-07-20 | Paper |
A faster exact algorithm for the directed maximum leaf spanning tree problem
Computer Science – Theory and Applications | 2010-06-22 | Paper |
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Finding consistent categorial grammars of bounded value: a parameterized approach
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Minimum dominating set of queens: a trivial programming exercise?
Discrete Applied Mathematics | 2010-05-05 | Paper |
Parameterized algorithms for \(d\)-hitting set: the weighted case
Theoretical Computer Science | 2010-04-15 | Paper |
A top-down approach to search-trees: Improved algorithmics for 3-hitting set
Algorithmica | 2010-03-04 | Paper |
A parameterized perspective on packing paths of length two
Journal of Combinatorial Optimization | 2010-02-24 | Paper |
Programmed grammars with rule queues
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
An amortized search tree analysis for \(k\)-leaf spanning tree
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Exact and parameterized algorithms for Max Internal Spanning Tree
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Parameterized and Exact Computation | 2010-01-14 | Paper |
The Complexity of Probabilistic Lobbying
Algorithmic Decision Theory | 2009-11-17 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Vertex and edge covers with clustering properties: Complexity and algorithms
Journal of Discrete Algorithms | 2009-06-24 | Paper |
On the complement graph and defensive \(k\)-alliances
Discrete Applied Mathematics | 2009-06-24 | Paper |
Searching Trees: An Essay
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Algorithms for learning regular expressions from positive data
Information and Computation | 2009-04-16 | Paper |
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
Information Processing Letters | 2009-03-23 | Paper |
Offensive \(r\)-alliances in graphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
Parameterized algorithmics for linear arrangement problems
Discrete Applied Mathematics | 2009-03-04 | Paper |
A bounded search tree algorithm for parameterized face cover
Journal of Discrete Algorithms | 2009-02-23 | Paper |
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
Algorithms and Computation | 2009-01-29 | Paper |
A Parameterized Perspective on Packing Paths of Length Two
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
Information and Computation | 2008-10-08 | Paper |
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
SIAM Journal on Computing | 2008-08-14 | Paper |
| Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars | 2008-08-12 | Paper |
| The degree of parallelism | 2008-08-12 | Paper |
Fixed parameter algorithms for one-sided crossing minimization revisited
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Learning tree languages from text
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Learning tree languages from text
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Learning tree languages from text
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Facility Location Problems: A Parameterized View
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
Frontiers in Algorithmics | 2008-06-19 | Paper |
| Blind counter automata on \(\omega\)-words | 2008-06-11 | Paper |
Kernels: Annotated, Proper and Induced
Parameterized and Exact Computation | 2008-06-03 | Paper |
edge dominating set: Efficient Enumeration-Based Exact Algorithms
Parameterized and Exact Computation | 2008-06-03 | Paper |
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
A sum labelling for the generalised friendship graph
Discrete Mathematics | 2008-02-14 | Paper |
R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
International Journal of Computer Mathematics | 2008-01-28 | Paper |
Decidability of code properties
RAIRO - Theoretical Informatics and Applications | 2007-11-14 | Paper |
Decidability of code properties
RAIRO - Theoretical Informatics and Applications | 2007-11-14 | Paper |
Decidability of code properties
RAIRO - Theoretical Informatics and Applications | 2007-11-14 | Paper |
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Speeding up Exact Algorithms With High Probability
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Parameterized Algorithms for Hitting Set: The Weighted Case
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Iterated sequential transducers as language generating devices
Theoretical Computer Science | 2007-01-09 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 5051563 (Why is no real title available?) | 2006-09-06 | Paper |
Two-Layer Planarization: Improving on Parameterized Algorithmics
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
A refined search tree technique for dominating set on planar graphs
Journal of Computer and System Sciences | 2005-12-07 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2182426 (Why is no real title available?) | 2005-06-23 | Paper |
| scientific article; zbMATH DE number 2150280 (Why is no real title available?) | 2005-03-30 | Paper |
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2104735 (Why is no real title available?) | 2004-10-01 | Paper |
Graph separators: A parameterized view
Journal of Computer and System Sciences | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2090012 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2089360 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2090199 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087231 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080921 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080444 (Why is no real title available?) | 2004-08-04 | Paper |
Identifying terminal distinguishable languages
Annals of Mathematics and Artificial Intelligence | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 2068874 (Why is no real title available?) | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 2060757 (Why is no real title available?) | 2004-03-18 | Paper |
| scientific article; zbMATH DE number 2050927 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2019597 (Why is no real title available?) | 2003-12-17 | Paper |
| scientific article; zbMATH DE number 2012396 (Why is no real title available?) | 2003-12-15 | Paper |
| scientific article; zbMATH DE number 2013187 (Why is no real title available?) | 2003-12-04 | Paper |
Parallel grammars: A phenomenology
Grammars | 2003-08-25 | Paper |
Identification of function distinguishable languages.
Theoretical Computer Science | 2003-08-17 | Paper |
On the degree of scattered context-sensitivity.
Theoretical Computer Science | 2003-08-17 | Paper |
Nonterminal complexity of programmed grammars.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1953093 (Why is no real title available?) | 2003-07-25 | Paper |
| Decidability of code properties | 2003-07-09 | Paper |
Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1882054 (Why is no real title available?) | 2003-03-13 | Paper |
| scientific article; zbMATH DE number 1870544 (Why is no real title available?) | 2003-02-18 | Paper |
Even linear simple matrix languages: formal language properties and grammatical inference.
Theoretical Computer Science | 2003-01-21 | Paper |
Iterated function systems and control languages
Information and Computation | 2003-01-14 | Paper |
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Algorithmica | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1836428 (Why is no real title available?) | 2002-11-27 | Paper |
| scientific article; zbMATH DE number 1834643 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1832346 (Why is no real title available?) | 2002-11-19 | Paper |
| scientific article; zbMATH DE number 1796976 (Why is no real title available?) | 2002-09-05 | Paper |
Sequential grammars and automata with valences
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1756013 (Why is no real title available?) | 2002-06-16 | Paper |
| scientific article; zbMATH DE number 1738663 (Why is no real title available?) | 2002-05-07 | Paper |
Bidirectional cooperating distributed grammar systems
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
Valences in Lindenmayer systems
Fundamenta Informaticae | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1670714 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1665446 (Why is no real title available?) | 2001-10-21 | Paper |
Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
Theoretical Computer Science | 2001-08-20 | Paper |
Parallel communicating grammar systems with terminal transmission
Acta Informatica | 2001-08-20 | Paper |
An efficient exact algorithm for constraint bipartite vertex cover
Journal of Algorithms | 2001-07-23 | Paper |
| scientific article; zbMATH DE number 1617251 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1542876 (Why is no real title available?) | 2001-02-26 | Paper |
Regulated grammars under leftmost derivation
Grammars | 2001-02-22 | Paper |
| scientific article; zbMATH DE number 1400024 (Why is no real title available?) | 2000-06-13 | Paper |
| scientific article; zbMATH DE number 1406163 (Why is no real title available?) | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1418354 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1418488 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1406170 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1361482 (Why is no real title available?) | 1999-11-10 | Paper |
| scientific article; zbMATH DE number 1222609 (Why is no real title available?) | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1302379 (Why is no real title available?) | 1999-06-16 | Paper |
| scientific article; zbMATH DE number 1244202 (Why is no real title available?) | 1999-01-24 | Paper |
Remarks on regulated limited ET0L systems and regulated context-free grammars
Theoretical Computer Science | 1998-08-13 | Paper |
| scientific article; zbMATH DE number 1114043 (Why is no real title available?) | 1998-06-02 | Paper |
| scientific article; zbMATH DE number 1089086 (Why is no real title available?) | 1998-02-26 | Paper |
Unconditional transfer in regulated rewriting
Acta Informatica | 1997-12-10 | Paper |
| scientific article; zbMATH DE number 992015 (Why is no real title available?) | 1997-08-07 | Paper |
| scientific article; zbMATH DE number 992006 (Why is no real title available?) | 1997-03-16 | Paper |
A note on uniformly limited ET0L systems with unique interpretation
Information Processing Letters | 1997-02-28 | Paper |
Valuations of languages, with applications to fractal geometry
Theoretical Computer Science | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 907949 (Why is no real title available?) | 1996-10-15 | Paper |
| scientific article; zbMATH DE number 845922 (Why is no real title available?) | 1996-06-27 | Paper |
Valuations, regular expressions, and fractal geometry
Applicable Algebra in Engineering, Communication and Computing | 1996-06-24 | Paper |
Remarks on accepting parallel systems
International Journal of Computer Mathematics | 1996-06-23 | Paper |
| scientific article; zbMATH DE number 827969 (Why is no real title available?) | 1996-05-27 | Paper |
Accepting grammars with regulation
International Journal of Computer Mathematics | 1995-10-10 | Paper |
| scientific article; zbMATH DE number 777286 (Why is no real title available?) | 1995-07-20 | Paper |
Infinite Iterated Function Systems
Mathematische Nachrichten | 1995-02-02 | Paper |
| scientific article; zbMATH DE number 641692 (Why is no real title available?) | 1994-09-21 | Paper |
| scientific article; zbMATH DE number 4191133 (Why is no real title available?) | 1991-01-01 | Paper |
