| Publication | Date of Publication | Type |
|---|
| Maximum path sets in trees | 2026-07-10 | Paper |
On the computational and approximation complexities of selected unit refutations in UTVPI constraint systems
Theoretical Computer Science | 2026-03-05 | Paper |
An analysis of Las Vegas algorithms for linear search
International Journal of Foundations of Computer Science | 2025-12-18 | Paper |
Advancing discrete optimization: novel approaches with dataless neural networks
Journal of Combinatorial Optimization | 2025-11-26 | Paper |
| From MAXCUT to MAXNAESAT: elegant proofs and algorithmic advances | 2025-11-20 | Paper |
| Unit refutations in Horn constraint systems | 2025-11-11 | Paper |
Unit refutability of Horn constraint systems -- certification and parallel complexity
Theoretical Computer Science | 2025-09-16 | Paper |
Parameterized lower bounds for the weighted vertex cover problem in trees
Acta Informatica | 2025-09-10 | Paper |
Proof Without Words: A New Proof of an Old Combinatorial Identity
The College Mathematics Journal | 2025-07-24 | Paper |
Optimal length cutting plane refutations of integer programs
Discrete Optimization | 2025-07-16 | Paper |
| The MASEMPR problem and its applications in logistics | 2025-06-20 | Paper |
Models for test cost minimization in database migration
INFORMS Journal on Computing | 2025-06-05 | Paper |
Analyzing the 3-path vertex cover problem in selected graph classes
Journal of Combinatorial Optimization | 2025-05-31 | Paper |
Correction to: ``Farkas bounds on Horn constraint systems''
Theory of Computing Systems | 2025-05-09 | Paper |
| Dag-like unit refutations in UTVPI constraint systems | 2025-04-15 | Paper |
The hexatope and octatope abstract domains for neural network verification
Formal Methods in System Design | 2025-01-13 | Paper |
Constrained read-once refutations in UTVPI constraint systems: a parallel perspective
Mathematical Structures in Computer Science | 2024-10-16 | Paper |
| Differentiable discrete optimization using dataless neural networks | 2024-09-16 | Paper |
| Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints | 2024-09-16 | Paper |
Arc-dependent networks: theoretical insights and a computational study
Annals of Operations Research | 2024-08-15 | Paper |
Proving the infeasibility of Horn formulas through read-once resolution
Discrete Applied Mathematics | 2024-06-20 | Paper |
Approximation algorithms for partial vertex covers in trees
International Journal of Foundations of Computer Science | 2024-06-13 | Paper |
Farkas Bounds on Horn Constraint Systems
Theory of Computing Systems | 2024-04-21 | Paper |
Security-aware database migration planning
Constraints | 2024-02-14 | Paper |
Priority-based bin packing with subset constraints
Discrete Applied Mathematics | 2024-01-24 | Paper |
The octatope abstract domain for verification of neural networks
Formal Methods | 2023-08-17 | Paper |
A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
Lecture Notes in Computer Science | 2023-08-14 | Paper |
On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
Lecture Notes in Computer Science | 2023-08-04 | Paper |
Reachability problems in interval-constrained and cardinality-constrained graphs
Discrete Mathematics, Algorithms and Applications | 2023-07-15 | Paper |
Reachability in choice networks
Discrete Optimization | 2023-06-30 | Paper |
Optimal deterministic controller synthesis from steady-state distributions
Journal of Automated Reasoning | 2023-06-14 | Paper |
On the approximability of path and cycle problems in arc-dependent networks
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
Integer feasibility and refutations in UTVPI constraints using bit-scaling
Algorithmica | 2023-02-16 | Paper |
| scientific article; zbMATH DE number 7650340 (Why is no real title available?) | 2023-02-03 | Paper |
Read-once refutations in Horn constraint systems: an algorithmic approach
Journal Of Logic And Computation | 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
Journal of Automated Reasoning | 2022-06-09 | Paper |
On the complexity of and solutions to the minimum stopping and trapping set problems
Theoretical Computer Science | 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
Annals of Mathematics and Artificial Intelligence | 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
Discrete Applied Mathematics | 2021-10-21 | Paper |
Copy complexity of Horn formulas with respect to unit read-once resolution
Theoretical Computer Science | 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
Theory of Computing Systems | 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
Mathematical Structures in Computer Science | 2021-01-07 | Paper |
Analyzing fractional Horn constraint systems
Theoretical Computer Science | 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
Logic and Its Applications | 2019-07-24 | Paper |
Clustering without replication in combinatorial circuits
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
Algorithmica | 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
Journal of Combinatorial Optimization | 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
Theoretical Computer Science | 2018-05-17 | Paper |
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
Journal of Combinatorial Optimization | 2018-03-01 | Paper |
Randomized algorithms for finding the shortest negative cost cycle in networks
Discrete Applied Mathematics | 2018-01-11 | Paper |
Partial vertex cover and budgeted maximum coverage in bipartite graphs
SIAM Journal on Discrete Mathematics | 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''
Annals of Mathematics and Artificial Intelligence | 2017-07-19 | Paper |
On the computational complexity of read once resolution decidability in 2CNF formulas
Lecture Notes in Computer Science | 2017-05-19 | Paper |
A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
Algorithmica | 2017-05-11 | Paper |
On the Shoshan-Zwick algorithm for the all-pairs shortest path problem
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
The approximability of partial vertex covers in trees
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Analyzing restricted fragments of the theory of linear arithmetic
Annals of Mathematics and Artificial Intelligence | 2017-03-06 | Paper |
Corrigendum to: ``On the negative cost girth problem in planar networks''
Journal of Discrete Algorithms | 2016-12-09 | Paper |
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
Lecture Notes in Computer Science | 2016-09-29 | Paper |
| Identifying negative cost cycles in strongly polynomial space | 2016-07-20 | Paper |
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Compositional bisimulation minimization for interval Markov decision processes
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Fast algorithms for the undirected negative cost cycle detection problem
Algorithmica | 2016-03-23 | Paper |
A Graphical Theorem of the Alternative for UTVPI Constraints
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
On clustering without replication in combinatorial circuits
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
On the negative cost girth problem in planar networks
Journal of Discrete Algorithms | 2015-11-17 | Paper |
On the approximability of the largest sphere rule ensemble classification problem
Information Processing Letters | 2015-07-15 | Paper |
Feasibility checking in Horn constraint systems through a reduction based approach
Theoretical Computer Science | 2015-05-18 | Paper |
A new algorithm for the minimum spanning tree verification problem
Computational Optimization and Applications | 2015-04-20 | Paper |
On quantified linear implications
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
A complexity perspective on entailment of parameterized linear constraints
Constraints | 2015-01-22 | Paper |
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
Advanced Information Systems Engineering | 2014-09-15 | Paper |
A combinatorial algorithm for Horn programs
Discrete Optimization | 2014-04-15 | Paper |
On the complexity of quantified linear systems
Theoretical Computer Science | 2014-01-13 | Paper |
Improved algorithms for optimal length resolution refutation in difference constraint systems
Formal Aspects of Computing | 2013-03-22 | Paper |
A new algorithm for linear and integer feasibility in Horn constraints
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
A mechanical verification of the stressing algorithm for negative cost cycle detection in networks
Science of Computer Programming | 2011-05-04 | Paper |
Absorbing random walks and the NAE2SAT problem
International Journal of Computer Mathematics | 2011-04-06 | Paper |
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
Computing | 2010-11-23 | Paper |
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Journal of Discrete Algorithms | 2010-05-25 | Paper |
On clausal equivalence and hull inclusion.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm
Applied Mathematics and Computation | 2010-02-09 | Paper |
Optimal length resolution refutations of difference constraint systems
Journal of Automated Reasoning | 2010-02-01 | Paper |
A combinatorial algorithm for Horn programs
Algorithms and Computation | 2009-12-17 | Paper |
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
Journal of Applied Mathematics and Decision Sciences | 2009-11-23 | Paper |
