| Publication | Date of Publication | Type |
|---|
| Parameterized lower bounds for problems in P via fine-grained cross-compositions | 2024-10-08 | Paper |
| The role of twins in computing planar supports of hypergraphs | 2024-10-08 | Paper |
| Deepening the (parameterized) complexity analysis of incremental stable matching problems | 2024-08-06 | Paper |
| Most classic problems remain NP-hard on relative neighborhood graphs and their relatives | 2024-05-27 | Paper |
| An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions | 2024-05-06 | Paper |
| Delay-robust routes in temporal graphs | 2024-04-23 | Paper |
| Approximating sparse quadratic programs | 2024-01-02 | Paper |
| Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs | 2023-11-14 | Paper |
| A multivariate complexity analysis of the material consumption scheduling problem | 2023-08-28 | Paper |
| Computing maximum matchings in temporal graphs | 2023-07-10 | Paper |
| Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality | 2023-07-03 | Paper |
| Multistage \(s-t\) path: confronting similarity with dissimilarity | 2023-06-28 | Paper |
| Equitable scheduling on a single machine | 2023-06-27 | Paper |
| Temporal interval cliques and independent sets | 2023-05-23 | Paper |
| On finding separators in temporal split and permutation graphs | 2023-04-21 | Paper |
| On 2-clubs in graph-based data clustering: theory and algorithm engineering | 2023-03-22 | Paper |
| Multidimensional stable roommates with master list | 2023-03-21 | Paper |
| Polynomial-time data reduction for weighted problems beyond additive goal functions | 2023-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874459 | 2023-02-07 | Paper |
| Parameterized Algorithms for Matrix Completion with Radius Constraints. | 2023-02-07 | Paper |
| Computing maximum matchings in temporal graphs. | 2023-02-07 | Paper |
| Multistage Vertex Cover | 2023-02-03 | Paper |
| Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters | 2023-02-03 | Paper |
| Recursively divisible problems | 2023-01-25 | Paper |
| The complexity of binary matrix completion under diameter constraints | 2023-01-09 | Paper |
| Bribery and control in stable marriage | 2022-12-21 | Paper |
| Line-up elections: parallel voting with shared candidate pool | 2022-12-21 | Paper |
| Feedback edge sets in temporal graphs | 2022-12-21 | Paper |
| Towards optimal locality in mesh-indexings | 2022-12-09 | Paper |
| Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks | 2022-12-09 | Paper |
| PRAM's towards realistic parallelism: BRAM's | 2022-12-09 | Paper |
| Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters | 2022-12-08 | Paper |
| The complexity of gerrymandering over graphs: paths and trees | 2022-11-11 | Paper |
| As Time Goes By: Reflections on Treewidth for Temporal Graphs | 2022-10-19 | Paper |
| The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality | 2022-10-06 | Paper |
| The structural complexity landscape of finding balance-fair shortest paths | 2022-09-27 | Paper |
| Complexity of shift bribery in committee elections | 2022-09-24 | Paper |
| Data Reduction for Maximum Matching on Real-World Graphs | 2022-09-06 | Paper |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | 2022-07-21 | Paper |
| Parameterized Dynamic Cluster Editing | 2022-07-21 | Paper |
| Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments | 2022-06-28 | Paper |
| On 2-clubs in graph-based data clustering: theory and algorithm engineering | 2022-06-28 | Paper |
| Towards classifying the polynomial-time solvability of temporal betweenness centrality | 2022-06-08 | Paper |
| The complexity of gerrymandering over graphs: paths and trees | 2022-06-08 | Paper |
| On finding separators in temporal split and permutation graphs | 2022-05-20 | Paper |
| Multistage vertex cover | 2022-05-09 | Paper |
| Envy-free allocations respecting social networks | 2022-04-11 | Paper |
| Combining clickstream analyses and graph-modeled data clustering for identifying common response processes | 2021-12-16 | Paper |
| Feedback edge sets in temporal graphs | 2021-12-07 | Paper |
| Bribery and control in stable marriage | 2021-10-05 | Paper |
| Robustness among multiwinner voting rules | 2021-08-16 | Paper |
| The complexity of finding small separators in temporal graphs | 2021-08-04 | Paper |
| Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments | 2021-08-04 | Paper |
| Interference-free Walks in Time: Temporally Disjoint Paths | 2021-05-18 | Paper |
| Multistage graph problems on a global budget | 2021-05-10 | Paper |
| Parameterized dynamic cluster editing | 2021-02-01 | Paper |
| Weighted tournament solutions | 2020-11-12 | Paper |
| The power of linear-time data reduction for maximum matching | 2020-11-11 | Paper |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | 2020-11-05 | Paper |
| Tight hardness results for consensus problems on circular strings and time series | 2020-10-27 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2020-09-08 | Paper |
| The Power of Linear-Time Data Reduction for Maximum Matching | 2020-05-26 | Paper |
| Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting | 2020-03-12 | Paper |
| The complexity of finding small separators in temporal graphs | 2019-11-29 | Paper |
| Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review | 2019-10-08 | Paper |
| Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions | 2019-10-01 | Paper |
| Data reduction, exact, and heuristic algorithms for clique cover | 2019-09-11 | Paper |
| The parameterized complexity of the minimum shared edges problem | 2019-08-30 | Paper |
| Multivariate algorithmics for NP-hard string problems | 2019-07-03 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2019-05-07 | Paper |
| A parameterized algorithmics framework for degree sequence completion problems in directed graphs | 2019-04-25 | Paper |
| The parameterized complexity of the rainbow subgraph problem | 2019-03-26 | Paper |
| Pattern-guided \(k\)-anonymity | 2019-03-26 | Paper |
| Co-clustering under the maximum norm | 2019-03-26 | Paper |
| A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths | 2019-03-06 | Paper |
| Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments | 2019-02-11 | Paper |
| A linear-time algorithm for maximum-cardinality matching on cocomparability graphs | 2018-12-05 | Paper |
| Stable roommate with narcissistic, single-peaked, and single-crossing preferences | 2018-10-25 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2018-09-06 | Paper |
| h-Index Manipulation by Undoing Merges | 2018-07-12 | Paper |
| A parameterized algorithmics framework for degree sequence completion problems in directed graphs | 2018-04-10 | Paper |
| Fractals for kernelization lower bounds | 2018-03-26 | Paper |
| Finding points in general position | 2018-02-22 | Paper |
| Robustness among multiwinner voting rules | 2018-02-13 | Paper |
| Elections with few voters: candidate control can be easy | 2018-01-12 | Paper |
| Fractals for kernelization lower bounds, with an application to length-bounded cut problems | 2017-12-19 | Paper |
| Optimal average case sorting on arrays | 2017-12-04 | Paper |
| Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs | 2017-09-29 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2017-09-22 | Paper |
| Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs | 2017-09-07 | Paper |
| A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack | 2017-09-01 | Paper |
| Assessing the computational complexity of multi-layer subgraph detection | 2017-07-21 | Paper |
| Parliamentary voting procedures: agenda control, manipulation, and uncertainty | 2017-07-13 | Paper |
| The parameterized complexity of the minimum shared edges problem | 2017-07-13 | Paper |
| The complexity of arc routing problems | 2017-07-11 | Paper |
| On making a distinguished vertex of minimum degree by vertex deletion | 2017-05-17 | Paper |
| The complexity of finding effectors | 2017-03-31 | Paper |
| Twins in Subdivision Drawings of Hypergraphs | 2017-02-21 | Paper |
| Prices matter for the parameterized complexity of shift bribery | 2016-11-18 | Paper |
| \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments | 2016-10-21 | Paper |
| Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics | 2016-10-21 | Paper |
| Win-win kernelization for degree sequence completion problems | 2016-06-13 | Paper |
| Large-scale election campaigns: combinatorial shift bribery | 2016-04-19 | Paper |
| Exploiting hidden structure in selecting dimensions that distinguish vectors | 2015-12-30 | Paper |
| The complexity of degree anonymization by vertex addition | 2015-12-08 | Paper |
| Polynomial-time data reduction for the subset interconnection design problem | 2015-11-27 | Paper |
| Interval scheduling and colorful independent sets | 2015-11-12 | Paper |
| Elections with few candidates: prices, weights, and covering problems | 2015-11-04 | Paper |
| The complexity of finding effectors | 2015-09-30 | Paper |
| A complexity dichotomy for finding disjoint solutions of vertex deletion problems | 2015-09-24 | Paper |
| A refined complexity analysis of finding the most vital edges for undirected shortest paths | 2015-09-21 | Paper |
| Co-clustering under the maximum norm | 2015-09-11 | Paper |
| The parameterized complexity of the rainbow subgraph problem | 2015-09-09 | Paper |
| Pattern matching for arc-annotated sequences | 2015-09-02 | Paper |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 2015-07-08 | Paper |
| A refined complexity analysis of degree anonymization in graphs | 2015-06-09 | Paper |
| Network-based vertex dissolution | 2015-06-08 | Paper |
| Combinatorial voter control in elections | 2015-06-01 | Paper |
| Using patterns to form homogeneous teams | 2015-05-26 | Paper |
| The complexity of degree anonymization by vertex addition | 2015-05-20 | Paper |
| On explaining integer vectors by few homogeneous segments | 2015-02-20 | Paper |
| Constant thresholds can make target set selection tractable | 2015-02-05 | Paper |
| Exploiting a hypergraph model for finding Golomb rulers | 2014-11-14 | Paper |
| Network-based dissolution | 2014-10-14 | Paper |
| Combinatorial voter control in elections | 2014-10-14 | Paper |
| Win-win kernelization for degree sequence completion problems | 2014-09-02 | Paper |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda | 2014-07-30 | Paper |
| Pattern-guided \(k\)-anonymity | 2014-04-03 | Paper |
| Data reduction and exact algorithms for clique cover | 2014-04-01 | Paper |
| The effect of homogeneity on the computational complexity of combinatorial data anonymization | 2014-02-19 | Paper |
| Effective and efficient data reduction for the subset interconnection design problem | 2014-01-14 | Paper |
| Incremental list coloring of graphs, parameterized by conservation | 2014-01-10 | Paper |
| How to Put through Your Agenda in Collective Binary Decisions | 2013-12-17 | Paper |
| The parameterized complexity of local search for TSP, more refined | 2013-11-11 | Paper |
| Confluence in data reduction: bridging graph transformation and kernelization | 2013-10-10 | Paper |
| A parameterized complexity analysis of combinatorial feature selection problems | 2013-09-20 | Paper |
| On explaining integer vectors by few homogenous segments | 2013-08-12 | Paper |
| A refined complexity analysis of degree anonymization in graphs | 2013-08-07 | Paper |
| Efficient algorithms for Eulerian extension and rural Postman | 2013-06-27 | Paper |
| Constant thresholds can make target set selection tractable | 2013-04-19 | Paper |
| Interval scheduling and colorful independent sets | 2013-03-21 | Paper |
| A new view on rural postman based on Eulerian extension and matching | 2013-01-18 | Paper |
| Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes | 2013-01-03 | Paper |
| Exploiting a Hypergraph Model for Finding Golomb Rulers | 2012-11-02 | Paper |
| Graph-based data clustering with overlaps | 2012-10-16 | Paper |
| New races in parameterized algorithmics | 2012-09-25 | Paper |
| Studies in Computational Aspects of Voting | 2012-09-05 | Paper |
| Confluence in data reduction: bridging graph transformation and kernelization | 2012-08-14 | Paper |
| Partitioning into colorful components by minimum edge deletions | 2012-08-14 | Paper |
| Linear-time computation of a linear problem kernel for dominating set on planar graphs | 2012-06-15 | Paper |
| On making directed graphs transitive | 2012-05-11 | Paper |
| Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion | 2012-04-26 | Paper |
| A generalization of Nemhauser and Trotter's local optimization theorem | 2012-04-24 | Paper |
| Aspects of a multivariate complexity analysis for rectangle tiling | 2012-04-05 | Paper |
| On bounded-degree vertex deletion parameterized by treewidth | 2012-03-19 | Paper |
| Reflections on multivariate algorithmics and problem parameterization | 2012-01-23 | Paper |
| A new view on rural postman based on Eulerian extension and matching | 2012-01-13 | Paper |
| A generalization of Nemhauser and Trotter's local optimization theorem | 2012-01-11 | Paper |
| From few components to an Eulerian graph by adding ARCS | 2011-12-16 | Paper |
| The parameterized complexity of local search for TSP, more refined | 2011-12-16 | Paper |
| Parameterized complexity of arc-weighted directed Steiner problems | 2011-10-27 | Paper |
| The effect of homogeneity on the complexity of \(k\)-anonymity | 2011-08-19 | Paper |
| Pattern-Guided Data Anonymization and Clustering | 2011-08-17 | Paper |
| A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing | 2011-07-18 | Paper |
| Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs | 2011-05-12 | Paper |
| Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring | 2011-05-03 | Paper |
| Average parameterization and partial kernelization for computing medians | 2011-04-28 | Paper |
| On making a distinguished vertex minimum degree by vertex deletion | 2011-02-15 | Paper |
| Separator-based data reduction for signed graph balancing | 2010-12-21 | Paper |
| On tractable cases of target set selection | 2010-12-09 | Paper |
| Partial kernelization for rank aggregation: theory and experiments | 2010-12-07 | Paper |
| Fixed-parameter tractability results for full-degree spanning tree and its dual | 2010-11-24 | Paper |
| Efficient algorithms for Eulerian extension | 2010-11-16 | Paper |
| Measuring indifference: unit interval vertex deletion | 2010-11-16 | Paper |
| Polynomial-time data reduction for dominating set | 2010-08-17 | Paper |
| Fixed-parameter algorithms for cluster vertex deletion | 2010-08-13 | Paper |
| Extended islands of tractability for parsimony haplotyping | 2010-07-26 | Paper |
| Incremental list coloring of graphs, parameterized by conservation | 2010-06-17 | Paper |
| Approximation and fixed-parameter algorithms for consecutive ones submatrix problems | 2010-05-25 | Paper |
| Average parameterization and partial kernelization for computing medians | 2010-04-27 | Paper |
| Kernelization through Tidying | 2010-04-27 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Two fixed-parameter algorithms for vertex covering by paths on trees | 2010-04-19 | Paper |
| Automated generation of search tree algorithms for graph modification problems | 2010-03-03 | Paper |
| Fixed-parameter tractability results for feedback set problems in tournaments | 2010-02-26 | Paper |
| Parameterized computational complexity of Dodgson and Young elections | 2010-02-26 | Paper |
| A fixed-parameter tractability result for multicommodity demand flow in trees | 2009-12-18 | Paper |
| Parameterized complexity of arc-weighted directed Steiner problems | 2009-12-17 | Paper |
| Isolation concepts for clique enumeration: comparison and computational experiments | 2009-11-25 | Paper |
| Fixed-parameter algorithms for Kemeny rankings | 2009-11-04 | Paper |
| On Making Directed Graphs Transitive | 2009-10-20 | Paper |
| A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems | 2009-10-16 | Paper |
| Isolation concepts for efficiently enumerating dense subgraphs | 2009-09-10 | Paper |
| Graph-Based Data Clustering with Overlaps | 2009-07-23 | Paper |
| Iterative Compression for Exactly Solving NP-Hard Minimization Problems | 2009-07-09 | Paper |
| Deconstructing Intractability: A Case Study for Interval Constrained Coloring | 2009-07-07 | Paper |
| A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing | 2009-07-02 | Paper |
| SOFSEM 2004: Theory and Practice of Computer Science | 2009-06-04 | Paper |
| Algorithms for compact letter displays: comparison and evaluation | 2009-06-02 | Paper |
| Red-blue covering problems and the consecutive ones property | 2009-05-13 | Paper |
| Isolation Concepts for Enumerating Dense Subgraphs | 2009-03-06 | Paper |
| Closest 4-leaf power is fixed-parameter tractable | 2009-03-04 | Paper |
| Enumerating Isolated Cliques in Synthetic and Financial Networks | 2009-01-27 | Paper |
| Improved algorithms and complexity results for power domination in graphs | 2008-12-02 | Paper |
| Parameterized Computational Complexity of Dodgson and Young Elections | 2008-07-15 | Paper |
| Fixed-Parameter Algorithms for Kemeny Scores | 2008-07-10 | Paper |
| Parameterized Algorithms and Hardness Results for Some Graph Motif Problems | 2008-06-17 | Paper |
| Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual | 2008-06-03 | Paper |
| Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems | 2008-05-27 | Paper |
| Fixed-Parameter Algorithms for Cluster Vertex Deletion | 2008-04-15 | Paper |
| Tree decompositions of graphs: saving memory in dynamic programming | 2008-01-11 | Paper |
| Probe Matrix Problems: Totally Balanced Matrices | 2008-01-04 | Paper |
| Optimal Edge Deletions for Signed Graph Balancing | 2008-01-02 | Paper |
| Parameterized complexity of Vertex Cover variants | 2007-12-19 | Paper |
| Linear Problem Kernels for NP-Hard Problems on Planar Graphs | 2007-11-28 | Paper |
| Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs | 2007-11-23 | Paper |
| Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems | 2007-11-13 | Paper |
| Minimum Membership Set Covering and the Consecutive Ones Property | 2007-09-07 | Paper |
| Tree Decompositions of Graphs: Saving Memory in Dynamic Programming | 2007-05-29 | Paper |
| Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments | 2007-05-02 | Paper |
| An efficient fixed-parameter algorithm for 3-hitting set | 2007-04-26 | Paper |
| Exact algorithms and applications for tree-like Weighted Set Cover | 2007-02-14 | Paper |
| THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS | 2007-02-08 | Paper |
| Experiments on data reduction for optimal domination in networks | 2007-02-05 | Paper |
| On the parameterized intractability of motif search problems | 2007-01-08 | Paper |
| Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization | 2006-12-07 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Parameterized intractability of distinguishing substring selection | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Error compensation in leaf power problems | 2006-08-16 | Paper |
| Graph-modeled data clustering: Exact algorithms for clique generation | 2006-02-08 | Paper |
| Fixed-parameter tractability and data reduction for multicut in trees | 2006-01-23 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| A refined search tree technique for dominating set on planar graphs | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710169 | 2005-12-01 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs | 2005-02-22 | Paper |
| Parameterized complexity: exponential speed-up for planar graph problems | 2004-11-23 | Paper |
| Computing the similarity of two sequences with nested arc annotations | 2004-10-27 | Paper |
| Automated generation of search tree algorithms for hard graphs modification problems | 2004-10-01 | Paper |
| A fixed-parameter algorithm for minimum quartet inconsistency | 2004-08-19 | Paper |
| Graph separators: A parameterized view | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046487 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044360 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736845 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737693 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474112 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472490 | 2004-08-04 | Paper |
| Fixed-parameter algorithms for CLOSEST STRING and related problems | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437501 | 2003-12-02 | Paper |
| Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. | 2003-09-15 | Paper |
| On efficient fixed-parameter algorithms for weighted vertex cover | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415254 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797430 | 2003-03-13 | Paper |
| Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779138 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551370 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547754 | 2002-08-21 | Paper |
| A general method to speed up fixed-parameter-tractable algorithms | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535799 | 2002-06-16 | Paper |
| Towards optimal locality in mesh-indexings | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728900 | 2001-11-04 | Paper |
| SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s | 2001-09-23 | Paper |
| An efficient exact algorithm for constraint bipartite vertex cover | 2001-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721971 | 2001-07-11 | Paper |
| Faster exact algorithms for hard problems: A parameterized point of view | 2001-07-05 | Paper |
| New Upper Bounds for Maximum Satisfiability | 2001-05-06 | Paper |
| On multidimensional curves with Hilbert property | 2000-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938646 | 2000-10-17 | Paper |
| Optimal deterministic sorting and routing on grids and tori with diagonals | 2000-05-28 | Paper |
| Data independence of read, write, and control structures in PRAM computations | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941917 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942648 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251072 | 1999-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218436 | 1999-05-02 | Paper |
| Unambiguous computations and locally definable acceptance types | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3127072 | 1997-04-03 | Paper |
| Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits | 1995-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281549 | 1994-06-13 | Paper |
