Peter Rossmanith
Orcid: 0000-0003-0177-8028Affiliations:
- RWTH Aachen University, Germany
According to our database1,
Peter Rossmanith
authored at least 136 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Proceedings of the Taming the Infinities of Concurrency, 2024
2023
Corrigendum: Decoding neuropathic pain: Can we predict fluctuations of propagation speed in stimulated peripheral nerve?
Frontiers Comput. Neurosci., February, 2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
2022
Decoding Neuropathic Pain: Can We Predict Fluctuations of Propagation Speed in Stimulated Peripheral Nerve?
Frontiers Comput. Neurosci., 2022
2021
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size.
Proceedings of the Approximation, 2020
2019
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs.
J. Comput. Syst. Sci., 2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019
2018
Discret. Appl. Math., 2018
CoRR, 2018
Algorithms, 2018
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
2017
J. Comput. Syst. Sci., 2017
CoRR, 2017
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
2016
ACM Trans. Algorithms, 2016
2014
J. Comput. Syst. Sci., 2014
Inf. Process. Lett., 2014
Dagstuhl Reports, 2014
Comput. Sci. Rev., 2014
CoRR, 2014
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
2013
Inf. Process. Lett., 2013
2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Proceedings of the Languages Alive, 2012
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012
2011
Theor. Comput. Sci., 2011
Theory Comput. Syst., 2011
J. Discrete Algorithms, 2011
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
CoRR, 2011
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2011
Proceedings of the Theory and Applications of Models of Computation, 2011
2010
Theory Comput. Syst., 2010
A Parameterized Route to Exact Puzzles: Breaking the 2<sup><i>n</i></sup>-Barrier for Irredundance.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
Theor. Comput. Sci., 2009
SIAM J. Discret. Math., 2009
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR, 2009
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution.
Proceedings of the Algorithms, 2009
Proceedings of the Computer Science, 2009
2008
Theory Comput. Syst., 2008
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
2007
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
2006
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
2003
J. Discrete Algorithms, 2003
J. Algorithms, 2003
Discret. Appl. Math., 2003
Algorithmica, 2003
2001
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries.
Theor. Comput. Sci., 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
2000
Inf. Process. Lett., 2000
Inf. Process. Lett., 2000
Electron. Colloquium Comput. Complex., 2000
A Uniform Framework for Problems on Context-Free Grammars.
Bull. EATCS, 2000
Proceedings of the Computer Aided Verification, 12th International Conference, 2000
1999
Algorithmica, 1999
Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999
1998
Theor. Comput. Sci., 1998
Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data.
Proceedings of the Grammatical Inference, 4th International Colloquium, 1998
1997
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997
1995
Inf. Comput., May, 1995
Parallel Process. Lett., 1995
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995
1994
Characterizations of memory access for PRAM's and bounds on the time complexity of Boolean functions.
PhD thesis, 1994
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994
1993
Forschungsberichte, TU Munich, 1993
Proceedings of the STACS 93, 1993
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Deterministic OL Languages are of Very Low Complexity: DOL is in AC<sup>0</sup>.
Proceedings of the Developments in Language Theory, 1993
1992
Forschungsberichte, TU Munich, 1992
Inf. Process. Lett., 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract).
Proceedings of the LATIN '92, 1992
1991
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
1990
Forschungsberichte, TU Munich, 1990
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990