K. Subramani

Piotr Wojciechowki

Theory Comput. Syst., April, 2024

On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective.

[BibT_eX]

[DOI]

Theory Comput. Syst., February, 2024

Priority-based bin packing with subset constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., January, 2024

2023

Optimal length cutting plane refutations of integer programs.

[BibT_eX]

[DOI]

Discret. Optim., November, 2023

Security-Aware Database Migration Planning.

[BibT_eX]

[DOI]

Utku Umur Acikalin

Constraints An Int. J., September, 2023

Unit Read-once Refutations for Systems of Difference Constraints.

[BibT_eX]

[DOI]

Theory Comput. Syst., August, 2023

Reachability problems in interval-constrained and cardinality-constrained graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., May, 2023

Reachability in choice networks.

[BibT_eX]

[DOI]

Discret. Optim., May, 2023

Optimal Deterministic Controller Synthesis from Steady-State Distributions.

[BibT_eX]

[DOI]

J. Autom. Reason., March, 2023

Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling.

[BibT_eX]

[DOI]

Algorithmica, February, 2023

A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

The Octatope Abstract Domain for Verification of Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods - 25th International Symposium, 2023

Unit Refutations of Difference Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

Differentiable Discrete Optimization Using Dataless Neural Networks.

[BibT_eX]

[DOI]

Sangram Kishor Jena

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

On the complexity of and solutions to the minimum stopping and trapping set problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Read-once refutations in Horn constraint systems: an algorithmic approach.

[BibT_eX]

[DOI]

Ying Sheng

J. Log. Comput., 2022

Analyzing Read-Once Cutting Plane Proofs in Horn Systems.

[BibT_eX]

[DOI]

R. Chandrasekaran

J. Autom. Reason., 2022

On the analysis of optimization problems in arc-dependent networks.

[BibT_eX]

[DOI]

Discret. Optim., 2022

On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2022

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2022

On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2022

Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs.

[BibT_eX]

[DOI]

Sangram Kishor Jena

Proceedings of the Theory and Applications of Models of Computation, 2022

Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Analyzing the Reachability Problem in Choice Networks.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

On the Approximability of Path and Cycle Problems in Arc-Dependent Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

New Results in Priority-Based Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - 7th International Symposium, 2022

2021

Copy complexity of Horn formulas with respect to unit read-once resolution.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the parametrized complexity of read-once refutations in UTVPI+ constraint systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Tree-Like Unit Refutations in Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2021

Analyzing Unit Read-Once Refutations in Difference Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 17th European Conference, 2021

On the Copy Complexity of Width 3 Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 13th International Symposium, 2021

Algorithmic Analysis of Priority-Based Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

New Results on Test-Cost Minimization in Database Migration.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - 6th International Symposium, 2021

2020

Analyzing fractional Horn constraint systems.

[BibT_eX]

[DOI]

R. Chandrasekaran

Theor. Comput. Sci., 2020

Analyzing Clustering and Partitioning Problems in Selected VLSI Models.

[BibT_eX]

[DOI]

Vahan V. Mkrtchyan

Theory Comput. Syst., 2020

NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2020

On integer closure in a system of unit two variable per inequality constraints.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2020

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

On Finding Shortest Paths in Arc-Dependent Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

On Unit Read-Once Resolutions and Copy Complexity.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

Clustering without replication in combinatorial circuits.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Empirical analysis of algorithms for the shortest negative cost cycle problem.

[BibT_eX]

[DOI]

Matthew Anderson

Discret. Appl. Math., 2019

Parameterized algorithms for Partial vertex covers in bipartite graphs.

[BibT_eX]

[DOI]

Garik Petrosyan

CoRR, 2019

A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2019

Read-Once Certification of Linear Infeasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Disjoint Clustering in Combinatorial Circuits.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

New Results on Cutting Plane Proofs for Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Restricted Cutting Plane Proofs in Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

Read-Once Resolutions in Horn Formulas.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

A Graphical Analysis of Integer Infeasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2019 - Advances in Artificial Intelligence, 2019

2018

Finding read-once resolution refutations in systems of 2CNF clauses.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

A certifying algorithm for lattice point feasibility in a system of UTVPI constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

On approximating optimal weight "no"-certificates in weighted difference constraint systems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Randomized algorithms for finding the shortest negative cost cycle in networks.

[BibT_eX]

[DOI]

James B. Orlin

Discret. Appl. Math., 2018

Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach.

[BibT_eX]

[DOI]

Steven L. Drager

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

Minimization of Testing Costs in Capacity-Constrained Database Migration.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Erratum to: Analyzing restricted fragments of the theory of linear arithmetic.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

Analyzing restricted fragments of the theory of linear arithmetic.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2017

On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

The Approximability of Partial Vertex Covers in Trees.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

The Complexity of Finding Read-Once NAE-Resolution Refutations.

[BibT_eX]

[DOI]

Proceedings of the Logic and Its Applications - 7th Indian Conference, 2017

On a Generalization of Horn Constraint Systems.

[BibT_eX]

[DOI]

Ramaswamy Chandrasekaran

Proceedings of the Computer Science - Theory and Applications, 2017

Analyzing Lattice Point Feasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

2016

Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50].

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem.

[BibT_eX]

[DOI]

Algorithmica, 2016

An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

Compositional Bisimulation Minimization for Interval Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

On the computational complexities of Quantified Integer Programming variants.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015

Feasibility checking in Horn constraint systems through a reduction based approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Identifying Negative Cost Cycles in Strongly Polynomial Space.

[BibT_eX]

Natarajan Shankar

Nord. J. Comput., 2015

On the negative cost girth problem in planar networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

On the approximability of the Largest Sphere Rule Ensemble Classification problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

A Parallel Implementation for the Negative Cost Girth Problem.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 2015

A new algorithm for the minimum spanning tree verification problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2015

A Graphical Theorem of the Alternative for UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

On Clustering Without Replication in Combinatorial Circuits.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

On the complexity of quantified linear systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Clustering without replication: approximation and inapproximability.

[BibT_eX]

[DOI]

CoRR, 2014

On Certifying Instances of Zero-Clairvoyant Scheduling.

[BibT_eX]

[DOI]

Comput. J., 2014

On quantified linear implications.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2014

Variants of Quantified Linear Programming and Quantified Linear Implication.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2014

2013

Polynomial time certifying algorithms for the planar quantified integer programming problem.

[BibT_eX]

[DOI]

Z. Liang

J. Log. Comput., 2013

Improved algorithms for optimal length resolution refutation in difference constraint systems.

[BibT_eX]

[DOI]

Xiaofeng Gu

Formal Aspects Comput., 2013

A combinatorial algorithm for Horn programs.

[BibT_eX]

[DOI]

R. Chandrasekaran

Discret. Optim., 2013

On Partial Vertex Cover on Bipartite Graphs and Trees

[BibT_eX]

[DOI]

CoRR, 2013

Analytical models for risk-based intrusion response.

[BibT_eX]

[DOI]

Comput. Networks, 2013

2012

A complexity perspective on entailment of parameterized linear constraints.

[BibT_eX]

[DOI]

Constraints An Int. J., 2012

Computational complexity of inclusion queries over polyhedral sets.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2011

A mechanical verification of the stressing algorithm for negative cost cycle detection in networks.

[BibT_eX]

[DOI]

Natarajan Shankar

Sci. Comput. Program., 2011

Absorbing random walks and the NAE2SAT problem.

[BibT_eX]

[DOI]

Xiaofeng Gu

Int. J. Comput. Math., 2011

A New Algorithm for Linear and Integer Feasibility in Horn Constraints.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Algorithmic Aspects of Risk Management.

[BibT_eX]

[DOI]

Ashish Gehani

Lee Zaniewski

Proceedings of the Formal Modeling: Actors, Open Systems, Biological Systems, 2011

2010

A faster algorithm for the single source shortest path problem with few distinct positive lengths.

[BibT_eX]

[DOI]

James B. Orlin

J. Discrete Algorithms, 2010

Two-level heaps: a new priority queue structure with applications to the single source shortest path problem.

[BibT_eX]

[DOI]

Computing, 2010

Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm.

[BibT_eX]

[DOI]

C. Tauras

Appl. Math. Comput., 2010

2009

On memoryless provers and insincere verifiers.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2009

Optimal Length Resolution Refutations of Difference Constraint Systems.

[BibT_eX]

[DOI]

J. Autom. Reason., 2009

On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls.

[BibT_eX]

[DOI]

Adv. Decis. Sci., 2009

Random walks for selected boolean implication and equivalence problems.

[BibT_eX]

[DOI]

Hong-Jian Lai

Xiaofeng Gu

Acta Informatica, 2009

Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

Fault Tolerant Sorting - Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm.

[BibT_eX]

[DOI]

C. Tauras

David Owen

J. Math. Model. Algorithms, 2008

A Randomized Queueless Algorithm for Breadth-First Search.

[BibT_eX]

Int. J. Comput. Their Appl., 2008

On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers.

[BibT_eX]

[DOI]

Kiran Yellajyosula

Int. J. Parallel Program., 2008

Computing inversion pair cardinality through partition-based sorting.

[BibT_eX]

[DOI]

Computing, 2008

Distributed algorithms for partially clairvoyant dispatchers.

[BibT_eX]

[DOI]

Kiran Yellajyosula

Ashraf M. Osman

Clust. Comput., 2008

Absorbing Random Walks and the NAE2SAT Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

An empirical analysis of algorithms for partially Clairvoyant scheduling.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2007

On Solving Boolean Combinations of UTVPI Constraints.

[BibT_eX]

[DOI]

Sanjit A. Seshia

Randal E. Bryant

J. Satisf. Boolean Model. Comput., 2007

A Zero-Space algorithm for Negative Cost Cycle Detection in networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Boolean Functions as Models for Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Xishun Zhao

J. Autom. Reason., 2007

A polynomial time algorithm for Zero-Clairvoyant scheduling.

[BibT_eX]

[DOI]

J. Appl. Log., 2007

On a decision procedure for quantified linear programs.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2007

A Randomized Algorithm for BBCSPs in the Prover-Verifier Model.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2007

Accomplishing Approximate FCFS Fairness Without Queues.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2007

2006

Chain Programming over Difference Constraints.

[BibT_eX]

John Argentieri

Nord. J. Comput., 2006

On using priced timed automata to achieve optimal scheduling.

[BibT_eX]

[DOI]

Jacob Illum Rasmussen

Kim Guldstrand Larsen

Formal Methods Syst. Des., 2006

An approximation algorithm for state minimization in 2-MDFAs.

[BibT_eX]

[DOI]

C. Tauras

Formal Aspects Comput., 2006

On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2006

Totally Clairvoyant Scheduling with Relative Timing Constraints.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2006

Analyzing Chain Programs over Difference Constraints.

[BibT_eX]

[DOI]

John Argentieri

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Erratum: An Analysis of Totally Clairvoyant Scheduling.

[BibT_eX]

[DOI]

J. Sched., 2005

An Analysis of Totally Clairvoyant Scheduling.

[BibT_eX]

[DOI]

J. Sched., 2005

Tractable Fragments of Presburger Arithmetic.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Periodic Linear Programming with applications to real-time scheduling.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2005

Out of order quantifier elimination for Standard Quantified Linear Programs.

[BibT_eX]

[DOI]

J. Symb. Comput., 2005

Partially clairvoyant scheduling for aggregate constraints.

[BibT_eX]

[DOI]

Adv. Decis. Sci., 2005

Cascading random walks.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

A greedy strategy for detecting negative cost cycles in networks.

[BibT_eX]

[DOI]

Lisa Kovalchick

Future Gener. Comput. Syst., 2005

A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling.

[BibT_eX]

[DOI]

Comput. J., 2005

On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks.

[BibT_eX]

[DOI]

Proceedings of the Computational Science, 2005

A New Verification Procedure for Partially Clairvoyant Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005

2004

Optimal length tree-like resolution refutations for 2SAT formulas.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2004

On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries.

[BibT_eX]

[DOI]

Math. Log. Q., 2004

Resource-Optimal Scheduling Using Priced Timed Automata.

[BibT_eX]

[DOI]

Jacob Illum Rasmussen

Kim Guldstrand Larsen

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers.

[BibT_eX]

[DOI]

Kiran Yellajyosula

Proceedings of the High Performance Computing, 2004

Analyzing Selected Quantified Integer Programs.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

Zero-Clairvoyant Scheduling with Inter-period Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2004

2003

An Analysis of Partially Clairvoyant Scheduling.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2003

On Boolean Models for Quantified Boolean Horn Formulas.

[BibT_eX]

[DOI]

Xishun Zhao

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

On Clausal Equivalence and Hull Inclusion.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem.

[BibT_eX]

[DOI]

Lisa Kovalchick

Proceedings of the Computational Science - ICCS 2003, 2003

An Analysis of Quantified Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

An Analysis of Zero-Clairvoyant Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

A Specification Framework for Real-Time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002

On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 2002

On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence, 2002

2001

A polyhedral projection procedure for Q2SAT.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Parametric Scheduling - Algorithms and Complexity.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001

Parametric Scheduling for Network Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

A Dual Interpretation of "Standard Constraints" in Parametric Scheduling.

[BibT_eX]

[DOI]