| Publication | Date of Publication | Type |
|---|
| Security-aware database migration planning | 2024-02-14 | Paper |
| Priority-based bin packing with subset constraints | 2024-01-24 | Paper |
| The octatope abstract domain for verification of neural networks | 2023-08-17 | Paper |
| A faster algorithm for determining the linear feasibility of systems of BTVPI constraints | 2023-08-14 | Paper |
| On the parallel complexity of constrained read-once refutations in UTVPI constraint systems | 2023-08-04 | Paper |
| Reachability problems in interval-constrained and cardinality-constrained graphs | 2023-07-15 | Paper |
| Reachability in choice networks | 2023-06-30 | Paper |
| Optimal deterministic controller synthesis from steady-state distributions | 2023-06-14 | Paper |
| On the approximability of path and cycle problems in arc-dependent networks | 2023-05-08 | Paper |
| Integer feasibility and refutations in UTVPI constraints using bit-scaling | 2023-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875680 | 2023-02-03 | Paper |
| Read-once refutations in Horn constraint systems: an algorithmic approach | 2022-09-22 | Paper |
| Analyzing the reachability problem in choice networks | 2022-08-30 | Paper |
| Exact and parameterized algorithms for read-once refutations in Horn constraint systems | 2022-07-01 | Paper |
| Analyzing read-once cutting plane proofs in Horn systems | 2022-06-09 | Paper |
| On the complexity of and solutions to the minimum stopping and trapping set problems | 2022-05-31 | Paper |
| Algorithmic analysis of priority-based bin packing | 2022-03-24 | Paper |
| On the copy complexity of width 3 Horn constraint systems | 2022-03-24 | Paper |
| Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas | 2022-02-14 | Paper |
| Analyzing unit read-once refutations in difference constraint systems | 2021-12-01 | Paper |
| Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints | 2021-10-21 | Paper |
| Copy complexity of Horn formulas with respect to unit read-once resolution | 2021-10-21 | Paper |
| Tree-like unit refutations in Horn constraint systems | 2021-10-04 | Paper |
| Analyzing clustering and partitioning problems in selected VLSI models | 2021-06-11 | Paper |
| On finding shortest paths in arc-dependent networks | 2021-02-04 | Paper |
| NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability | 2021-01-07 | Paper |
| Analyzing fractional Horn constraint systems | 2020-10-21 | Paper |
| Optimal length tree-like refutations of linear feasibility in UTVPI constraints | 2020-07-07 | Paper |
| Restricted cutting plane proofs in Horn constraint systems | 2020-05-13 | Paper |
| Disjoint clustering in combinatorial circuits | 2020-02-25 | Paper |
| Read-once certification of linear infeasibility in UTVPI constraints | 2019-10-15 | Paper |
| Read-once resolutions in Horn formulas | 2019-10-11 | Paper |
| The Complexity of Finding Read-Once NAE-Resolution Refutations | 2019-07-24 | Paper |
| Clustering without replication in combinatorial circuits | 2019-06-25 | Paper |
| A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints | 2019-05-21 | Paper |
| Finding minimum stopping and trapping sets: an integer linear programming approach | 2018-08-17 | Paper |
| On approximating optimal weight ``no-certificates in weighted difference constraint systems | 2018-07-20 | Paper |
| A fully polynomial time approximation scheme for refutations in weighted difference constraint systems | 2018-06-05 | Paper |
| Finding read-once resolution refutations in systems of 2CNF clauses | 2018-05-17 | Paper |
| A certifying algorithm for lattice point feasibility in a system of UTVPI constraints | 2018-03-01 | Paper |
| Randomized algorithms for finding the shortest negative cost cycle in networks | 2018-01-11 | Paper |
| Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs | 2017-09-27 | Paper |
| On a generalization of Horn constraint systems | 2017-08-22 | Paper |
| Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic | 2017-07-19 | Paper |
| On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas | 2017-05-19 | Paper |
| A combinatorial certifying algorithm for linear feasibility in UTVPI constraints | 2017-05-11 | Paper |
| On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem | 2017-04-05 | Paper |
| The Approximability of Partial Vertex Covers in Trees | 2017-04-04 | Paper |
| Analyzing restricted fragments of the theory of linear arithmetic | 2017-03-06 | Paper |
| Corrigendum to: ``On the negative cost girth problem in planar networks | 2016-12-09 | Paper |
| A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740949 | 2016-07-20 | Paper |
| An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints | 2016-05-03 | Paper |
| Compositional Bisimulation Minimization for Interval Markov Decision Processes | 2016-04-13 | Paper |
| Fast algorithms for the undirected negative cost cycle detection problem | 2016-03-23 | Paper |
| A Graphical Theorem of the Alternative for UTVPI Constraints | 2016-02-25 | Paper |
| On Clustering Without Replication in Combinatorial Circuits | 2016-02-05 | Paper |
| On the negative cost girth problem in planar networks | 2015-11-17 | Paper |
| On the approximability of the largest sphere rule ensemble classification problem | 2015-07-15 | Paper |
| Feasibility checking in Horn constraint systems through a reduction based approach | 2015-05-18 | Paper |
| A new algorithm for the minimum spanning tree verification problem | 2015-04-20 | Paper |
| On quantified linear implications | 2015-02-05 | Paper |
| A complexity perspective on entailment of parameterized linear constraints | 2015-01-22 | Paper |
| On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs | 2014-09-15 | Paper |
| A combinatorial algorithm for Horn programs | 2014-04-15 | Paper |
| On the complexity of quantified linear systems | 2014-01-13 | Paper |
| Improved algorithms for optimal length resolution refutation in difference constraint systems | 2013-03-22 | Paper |
| A New Algorithm for Linear and Integer Feasibility in Horn Constraints | 2011-05-26 | Paper |
| A mechanical verification of the stressing algorithm for negative cost cycle detection in networks | 2011-05-04 | Paper |
| Absorbing random walks and the NAE2SAT problem | 2011-04-06 | Paper |
| Two-level heaps: a new priority queue structure with applications to the single source shortest path problem | 2010-11-23 | Paper |
| A faster algorithm for the single source shortest path problem with few distinct positive lengths | 2010-05-25 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm | 2010-02-09 | Paper |
| Optimal length resolution refutations of difference constraint systems | 2010-02-01 | Paper |
| A Combinatorial Algorithm for Horn Programs | 2009-12-17 | Paper |
| On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls | 2009-11-23 | Paper |
| On memoryless provers and insincere verifiers | 2009-10-29 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs | 2009-07-14 | Paper |
| Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem | 2009-07-07 | Paper |
| Random walks for selected Boolean implication and equivalence problems | 2009-04-27 | Paper |
| Partially clairvoyant scheduling for aggregate constraints | 2008-11-20 | Paper |
| A Randomized Algorithm for BBCSPs in the Prover-Verifier Model | 2008-09-17 | Paper |
| On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers | 2008-09-02 | Paper |
| A polynomial time algorithm for Zero-Clairvoyant scheduling | 2008-03-11 | Paper |
| A zero-space algorithm for negative cost cycle detection in networks | 2008-01-11 | Paper |
| An analysis of totally clairvoyant scheduling | 2007-12-20 | Paper |
| On a decision procedure for quantified linear programs | 2007-12-03 | Paper |
| An empirical analysis of algorithms for partially Clairvoyant scheduling | 2007-10-24 | Paper |
| Out of order quantifier elimination for standard quantified linear programs | 2007-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5309034 | 2007-10-09 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Automated Reasoning | 2007-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5757090 | 2007-08-24 | Paper |
| Boolean functions as models for quantified Boolean formulas | 2007-08-17 | Paper |
| Erratum: An analysis of totally clairvoyant scheduling | 2007-05-15 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2007-02-12 | Paper |
| An approximation algorithm for state minimization in 2-MDFAs | 2006-12-20 | Paper |
| On using priced timed automata to achieve optimal scheduling | 2006-11-17 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection | 2006-05-16 | Paper |
| Tractable fragments of Presburger arithmetic | 2006-02-08 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making | 2005-08-17 | Paper |
| CASCADING RANDOM WALKS | 2005-08-01 | Paper |
| Periodic Linear Programming with applications to real-time scheduling | 2005-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808721 | 2004-08-12 | Paper |
| On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472230 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473910 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452107 | 2004-02-11 | Paper |
| An analysis of partially Clairvoyant scheduling | 2003-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417352 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553243 | 2002-11-04 | Paper |
| Analysis and simulation of mixed-technology VLSI systems | 2002-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766639 | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741538 | 2001-09-24 | Paper |
