| Publication | Date of Publication | Type |
|---|
| Near-optimal algorithms for point-line covering problems | 2024-04-23 | Paper |
| Approximating closest vector problem in \(\ell_\infty\) norm revisited | 2024-02-23 | Paper |
| Graph ear decompositions and graph embeddings | 2024-01-05 | Paper |
| Algorithmic graph embeddings | 2023-12-12 | Paper |
| On log-time alternating Turing machines of alternation depth k | 2023-12-12 | Paper |
| Novel neuromuscular controller application method to improve the balance recovery ability of lower limb exoskeletons | 2023-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6104071 | 2023-06-05 | Paper |
| On the complexity of graph embeddings | 2023-01-18 | Paper |
| Linear-time parameterized algorithms with limited local resources | 2022-12-08 | Paper |
| Scheduling on multiple two-stage flowshops with a deadline | 2022-07-01 | Paper |
| Scheduling multiple two-stage flowshops with a deadline | 2022-05-23 | Paper |
| A refined branching algorithm for the maximum satisfiability problem | 2022-03-22 | Paper |
| A Topologically Complete Theory of Weaving | 2020-12-10 | Paper |
| On scheduling multiple two-stage flowshops | 2020-04-07 | Paper |
| Improved approximation algorithms for two-stage flowshops scheduling problem | 2020-01-16 | Paper |
| On scheduling inclined jobs on multiple two-stage flowshops | 2019-08-20 | Paper |
| Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms | 2019-06-25 | Paper |
| Scheduling two-stage jobs on multiple flowshops | 2019-05-29 | Paper |
| On Approximation Algorithms for Two-Stage Scheduling Problems | 2019-04-26 | Paper |
| Approximation algorithms on multiple two-stage flowshops | 2018-10-04 | Paper |
| A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees | 2018-09-07 | Paper |
| Locally subcube-connected hypercube networks: theoretical analysis and experimental results | 2018-07-09 | Paper |
| An improved FPT algorithm for almost forest deletion problem | 2018-05-25 | Paper |
| Corrigendum to: ``Advice classes of parameterized tractability | 2018-03-21 | Paper |
| On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms | 2017-06-20 | Paper |
| Dealing with 4-variables by resolution: an improved MaxSAT algorithm | 2017-03-16 | Paper |
| Partition on trees with supply and demand: kernelization and algorithms | 2017-02-06 | Paper |
| Improved kernel results for some FPT problems based on simple observations | 2017-02-06 | Paper |
| Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree | 2016-12-22 | Paper |
| Approximating maximum agreement forest on multiple binary trees | 2016-12-21 | Paper |
| A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) | 2016-09-29 | Paper |
| A note on approximating graph genus | 2016-06-01 | Paper |
| Improved MaxSAT Algorithms for Instances of Degree 3 | 2016-02-05 | Paper |
| On the parameterized vertex cover problem for graphs with perfect matching | 2015-11-20 | Paper |
| A fixed-parameter algorithm for the directed feedback vertex set problem | 2015-11-11 | Paper |
| Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm | 2015-10-30 | Paper |
| A 2k-vertex Kernel for Maximum Internal Spanning Tree | 2015-10-30 | Paper |
| On feedback vertex set: new measure and new structures | 2015-09-03 | Paper |
| Parameterized complexity of control and bribery for \(d\)-approval elections | 2015-07-24 | Paper |
| Extended graph rotation systems as a model for cyclic weaving on orientable surfaces | 2015-07-24 | Paper |
| Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems | 2015-07-10 | Paper |
| An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs | 2015-07-10 | Paper |
| Edge deletion problems: branching facilitated by modular decomposition | 2015-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934608 | 2014-12-18 | Paper |
| Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees | 2014-12-02 | Paper |
| Improved parameterized algorithms for minimum link-length rectilinear spanning path problem | 2014-12-02 | Paper |
| Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees | 2014-10-08 | Paper |
| Algorithms for parameterized maximum agreement forest problem on multiple trees | 2014-10-06 | Paper |
| Approximation Algorithms for Maximum Agreement Forest on Multiple Trees | 2014-09-26 | Paper |
| Iterative Expansion and Color Coding | 2014-09-09 | Paper |
| An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem | 2014-04-15 | Paper |
| Matching and weighted \(P_2\)-packing: algorithms and kernels | 2014-01-24 | Paper |
| Parameterized complexity of max-lifetime target coverage in wireless sensor networks | 2014-01-13 | Paper |
| Improved linear problem kernel for planar connected dominating set | 2014-01-13 | Paper |
| Parameterized Complexity of Control and Bribery for d-Approval Elections | 2013-12-10 | Paper |
| Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees | 2013-12-06 | Paper |
| An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem | 2013-08-16 | Paper |
| Planar graph vertex partition for linear problem kernels | 2013-07-24 | Paper |
| Random Methods for Parameterized Problems | 2013-06-11 | Paper |
| An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs | 2013-06-11 | Paper |
| Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees | 2013-06-11 | Paper |
| On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem | 2013-05-28 | Paper |
| Parameterized top-\(K\) algorithms | 2013-02-19 | Paper |
| Complexity and parameterized algorithms for cograph editing | 2012-11-27 | Paper |
| Cluster editing: kernelization based on edge cuts | 2012-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2919754 | 2012-10-05 | Paper |
| Parameterized Complexity and Subexponential-Time Computability | 2012-09-05 | Paper |
| Multicut in trees viewed through the eyes of vertex cover | 2012-08-17 | Paper |
| Improved FPT Algorithms for Rectilinear k-Links Spanning Path | 2012-07-16 | Paper |
| FPT Results for Signed Domination | 2012-07-16 | Paper |
| A \(2k\) kernel for the cluster editing problem | 2012-05-11 | Paper |
| A parameterized algorithm for the hyperplane-cover problem | 2012-04-03 | Paper |
| Cograph Editing: Complexity and Parameterized Algorithms | 2011-08-17 | Paper |
| Matching and P 2-Packing: Weighted Versions | 2011-08-17 | Paper |
| Linear Problem Kernels for Planar Graph Problems with Small Distance Property | 2011-08-17 | Paper |
| Multicut in Trees Viewed through the Eyes of Vertex Cover | 2011-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3014297 | 2011-07-19 | Paper |
| An Improved Kernel for Planar Connected Dominating Set | 2011-07-01 | Paper |
| On the planarization of wireless sensor networks | 2011-06-30 | Paper |
| Improved deterministic algorithms for weighted matching and packing problems | 2011-05-18 | Paper |
| An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem | 2011-04-05 | Paper |
| Improved Algorithms for Weighted 3-Set Packing | 2011-02-05 | Paper |
| Cluster Editing: Kernelization Based on Edge Cuts | 2010-12-07 | Paper |
| A practical parameterised algorithm for the individual haplotyping problem MLF | 2010-12-01 | Paper |
| Kernelization Techniques and Its Applications to Parameterized Computation | 2010-11-05 | Paper |
| Improved upper bounds for vertex cover | 2010-10-11 | Paper |
| An improved kernelization for \(P_{2}\)-packing | 2010-09-07 | Paper |
| Linear FPT reductions and computational lower bounds | 2010-08-15 | Paper |
| A 2k Kernel for the Cluster Editing Problem | 2010-07-20 | Paper |
| On Feedback Vertex Set New Measure and New Structures | 2010-06-22 | Paper |
| An improved lower bound on approximation algorithms for the closest substring problem | 2010-04-19 | Paper |
| A practical exact algorithm for the individual haplotyping problem MEC/GI | 2010-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656220 | 2010-01-13 | Paper |
| Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms | 2010-01-06 | Paper |
| Improved parameterized set splitting algorithms: A Probabilistic approach | 2009-11-25 | Paper |
| On counting 3-D matchings of size \(k\) | 2009-11-25 | Paper |
| An Improved SAT Algorithm in Terms of Formula Length | 2009-10-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| An improved parameterized algorithm for the minimum node multiway cut problem | 2009-07-24 | Paper |
| The cost of becoming anonymous: on the participant payload in crowds | 2009-07-21 | Paper |
| An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set | 2009-07-14 | Paper |
| On parameterized exponential time complexity | 2009-07-10 | Paper |
| On Parameterized Exponential Time Complexity | 2009-06-03 | Paper |
| On the pseudo-achromatic number problem | 2009-03-17 | Paper |
| A practical algorithm based on particle swarm optimization for haplotype reconstruction | 2009-03-10 | Paper |
| A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem | 2009-03-06 | Paper |
| Improved Algorithms for Weighted and Unweighted Set Splitting Problems | 2009-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3610987 | 2009-03-06 | Paper |
| A Lower Bound on Approximation Algorithms for the Closest Substring Problem | 2009-03-03 | Paper |
| Improved Algorithms for the Feedback Vertex Set Problems | 2009-02-17 | Paper |
| An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem | 2009-02-17 | Paper |
| On the Pseudo-achromatic Number Problem | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549698 | 2009-01-05 | Paper |
| Improved algorithms for feedback vertex set problems | 2008-11-19 | Paper |
| Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size | 2008-08-14 | Paper |
| A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI | 2008-07-10 | Paper |
| A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem | 2008-06-19 | Paper |
| Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters | 2008-06-05 | Paper |
| Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms | 2008-06-03 | Paper |
| On the Effective Enumerability of NP Problems | 2008-06-03 | Paper |
| An Improved Parameterized Algorithm for a Generalized Matching Problem | 2008-05-27 | Paper |
| A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5453224 | 2008-04-04 | Paper |
| Parameterized Algorithms for Weighted Matching and Packing Problems | 2007-11-13 | Paper |
| An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs | 2007-11-13 | Paper |
| Finding pathway structures in protein interaction networks | 2007-09-10 | Paper |
| Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem | 2007-09-06 | Paper |
| Improved Parameterized Upper Bounds for Vertex Cover | 2007-09-05 | Paper |
| Genus characterizes the complexity of certain graph problems: Some tight results | 2007-08-23 | Paper |
| Probabilistic analysis on connectivity for sensor grids with unreliable nodes | 2007-06-01 | Paper |
| Polynomial time approximation schemes and parameterized complexity | 2007-02-19 | Paper |
| Probabilistic analysis on mesh network fault tolerance | 2007-02-19 | Paper |
| A simple linear time approximation algorithm for multi-processor job scheduling on four processors | 2007-02-14 | Paper |
| On product covering in 3-tier supply chain models: natural complete problems for W[3 and W[4]] | 2007-01-09 | Paper |
| Strong computational lower bounds via parameterized complexity | 2006-12-07 | Paper |
| On the structure of parameterized problems in NP | 2006-10-10 | Paper |
| On the computational hardness based on linear fpt-reductions | 2006-08-14 | Paper |
| Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems | 2006-03-21 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Parameterized computation and complexity: a new approach dealing with NP-hardness | 2005-12-29 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Tight lower bounds for certain parameterized NP-hard problems | 2005-10-10 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| On approximating minimum vertex cover for graphs with perfect matching | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823913 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823953 | 2004-10-28 | Paper |
| An efficient parameterized algorithm for m-set packing | 2004-10-04 | Paper |
| Using nondeterminism to design efficient deterministic algorithms | 2004-10-01 | Paper |
| Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms | 2004-08-19 | Paper |
| Improved exact algorithms for MAX-SAT | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044338 | 2004-08-11 | Paper |
| On the construction of most reliable networks | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472480 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472486 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472510 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474073 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474212 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448746 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448766 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449224 | 2004-02-08 | Paper |
| A minimal and complete set of operators for the development of robust manifold mesh modelers | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427861 | 2003-09-14 | Paper |
| On strong Menger-connectivity of star graphs | 2003-09-09 | Paper |
| A note on practical construction of maximum bandwidth paths. | 2003-01-21 | Paper |
| Vertex Cover: Further Observations and Further Improvements | 2002-07-08 | Paper |
| An effective randomized QoS routing algorithm on networks with inaccurate parameters | 2002-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779602 | 2002-04-15 | Paper |
| A fixed-parameter-tractable algorithm for set packing | 2002-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751899 | 2001-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751941 | 2001-10-21 | Paper |
| A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506265 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944990 | 2000-06-07 | Paper |
| Tight bound on Johnson's algorithm for maximum satisfiability | 1999-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4238573 | 1999-10-04 | Paper |
| Graph Ear Decompositions and Graph Embeddings | 1999-06-27 | Paper |
| The Maximum Partition Matching Problem with Applications | 1999-02-22 | Paper |
| Algorithmic graph embeddings | 1998-07-22 | Paper |
| On the parameterized complexity of short computation and factorization | 1998-06-02 | Paper |
| Circuit Bottom Fan-in and Computational Power | 1998-05-10 | Paper |
| Advice classes of parametrized tractability | 1997-11-02 | Paper |
| On fixed-parameter tractability and approximability of NP optimization problems | 1997-08-03 | Paper |
| On the Amount of Nondeterminism and the Power of Verifying | 1997-05-26 | Paper |
| Algebraic specification of interconnection network relationships by permutation voltage graph mappings | 1997-03-03 | Paper |
| On input read-modes of alternating Turing machines | 1997-02-28 | Paper |
| A tight lower bound on the maximum genus of a simplicial graph | 1997-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871140 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871163 | 1996-08-13 | Paper |
| Maximum genus and connectivity | 1996-03-25 | Paper |
| Lower bounds for the average genus | 1995-05-14 | Paper |
| A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus | 1994-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281642 | 1994-06-07 | Paper |
| Overlap matrices and total imbedding distributions | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281636 | 1994-03-10 | Paper |
| Limit points for average genus. II: 2-connected non-simplicial graphs | 1993-03-10 | Paper |
| Kuratowski-type theorems for average genus | 1993-03-10 | Paper |
| Characterizing parallel hierarchies by reducibilities | 1992-06-28 | Paper |
| An NL hierarchy | 1992-06-27 | Paper |
| Reversal Complexity | 1992-06-25 | Paper |
| Limit points for average genus. I: 3-connected and 2-connected simplicial graphs | 1992-01-01 | Paper |
| The difference between one tape and two tapes: With respect to reversal complexity | 1990-01-01 | Paper |
| A new complete language for DSPACE(log n) | 1989-01-01 | Paper |
