default search action
Piotr Wojciechowski 0002
Person information
- affiliation: West Virginia University, LDCSEE, Morgantown, WV, USA
Other persons with the same name
- Piotr J. Wojciechowski
(aka: Piotr Wojciechowski 0001) — University of Texas at El Paso, Department of Mathematical Sciences, TX, USA
- Piotr Wojciechowski 0003 — University of Warsaw, Faculty of Chemistry, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Alvaro Velasquez, Piotr Wojciechowski, K. Subramani
Arc-dependent networks: theoretical insights and a computational study. Ann. Oper. Res. 338(2): 1101-1126 (2024) - [j33]Piotr Wojciechowski, K. Subramani
Priority-based bin packing with subset constraints. Discret. Appl. Math. 342: 64-75 (2024) - [j32]Piotr Wojciechowski, K. Subramani
Proving the infeasibility of Horn formulas through read-once resolution. Discret. Appl. Math. 354: 131-145 (2024) - [j31]K. Subramani
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective. Math. Struct. Comput. Sci. 34(3): 227-243 (2024) - [j30]Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. Theory Comput. Syst. 68(1): 122-143 (2024) - [j29]K. Subramani, Piotr Wojciechowski, Alvaro Velasquez:
Farkas Bounds on Horn Constraint Systems. Theory Comput. Syst. 68(2): 227-249 (2024) - [c42]Sangram K. Jena, Piotr Wojciechowski:
Representation of Dominating Set Variants Using Dataless Neural Networks. AAIM (2) 2024: 15-26 - [c41]K. Subramani, Piotr Wojciechowski:
On the Computational Complexities of Finding Selected Refutations of Linear Programs. ISAIM 2024: 81-93 - [c40]Piotr Wojciechowski
A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems. LOPSTR 2024: 99-114 - 2023
- [j28]K. Subramani
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling. Algorithmica 85(2): 610-637 (2023) - [j27]Piotr Wojciechowski
Reachability in choice networks. Discret. Optim. 48(Part 1): 100761 (2023) - [j26]K. Subramani
Optimal length cutting plane refutations of integer programs. Discret. Optim. 50: 100806 (2023) - [j25]Alvaro Velasquez, K. Subramani
Reachability problems in interval-constrained and cardinality-constrained graphs. Discret. Math. Algorithms Appl. 15(4): 2250110:1-2250110:26 (2023) - [j24]Alvaro Velasquez, Ismail Alkhouri, K. Subramani
Optimal Deterministic Controller Synthesis from Steady-State Distributions. J. Autom. Reason. 67(1): 7 (2023) - [j23]K. Subramani
Unit Read-once Refutations for Systems of Difference Constraints. Theory Comput. Syst. 67(4): 877-899 (2023) - [c39]K. Subramani, Piotr Wojciechowski:
Optimal Length Cutting Plane Refutations of Integer Programs. CALDAM 2023: 15-27 - [c38]K. Subramani, Piotr Wojciechowski:
Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints. COCOA (2) 2023: 377-389 - [c37]K. Subramani
Unit Refutations of Difference Constraint Systems. ECAI 2023: 2226-2233 - [c36]Stanley Bak
The Octatope Abstract Domain for Verification of Neural Networks. FM 2023: 454-472 - [c35]Piotr Wojciechowski, K. Subramani:
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. SOFSEM 2023: 313-327 - 2022
- [j22]K. Subramani
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas. Ann. Math. Artif. Intell. 90(1): 3-29 (2022) - [j21]Piotr Wojciechowski
On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems. Ann. Math. Artif. Intell. 90(10): 979-998 (2022) - [j20]Piotr Wojciechowski
On the analysis of optimization problems in arc-dependent networks. Discret. Optim. 45: 100729 (2022) - [j19]Piotr Wojciechowski
Analyzing Read-Once Cutting Plane Proofs in Horn Systems. J. Autom. Reason. 66(2): 239-274 (2022) - [j18]K. Subramani
Read-once refutations in Horn constraint systems: an algorithmic approach. J. Log. Comput. 32(4): 667-696 (2022) - [j17]Alvaro Velasquez, K. Subramani
On the complexity of and solutions to the minimum stopping and trapping set problems. Theor. Comput. Sci. 915: 26-44 (2022) - [c34]K. Subramani, Piotr Wojciechowski, Alvaro Velasquez:
New Results in Priority-Based Bin Packing. ALGOCLOUD 2022: 58-72 - [c33]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson:
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. CALDAM 2022: 292-304 - [c32]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez:
Analyzing the Reachability Problem in Choice Networks. CPAIOR 2022: 408-423 - [c31]K. Subramani, Piotr Wojciechowski:
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. LFCS 2022: 327-345 - [c30]K. Subramani, Piotr Wojciechowski:
On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems. TAMC 2022: 293-304 - 2021
- [j16]Piotr Wojciechowski
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discret. Appl. Math. 305: 272-294 (2021) - [j15]K. Subramani
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems. Theor. Comput. Sci. 883: 1-18 (2021) - [j14]Piotr Wojciechowski
Copy complexity of Horn formulas with respect to unit read-once resolution. Theor. Comput. Sci. 890: 70-86 (2021) - [c29]Utku Umur Acikalin, Bugra Çaskurlu, Piotr Wojciechowski, K. Subramani:
New Results on Test-Cost Minimization in Database Migration. ALGOCLOUD 2021: 38-55 - [c28]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu:
Algorithmic Analysis of Priority-Based Bin Packing. CALDAM 2021: 359-372 - [c27]K. Subramani, Piotr Wojciechowski, Alvaro Velasquez:
On the Copy Complexity of Width 3 Horn Constraint Systems. FroCoS 2021: 63-78 - [c26]K. Subramani, Piotr Wojciechowski:
Analyzing Unit Read-Once Refutations in Difference Constraint Systems. JELIA 2021: 147-161 - [c25]K. Subramani, Piotr Wojciechowski:
Tree-Like Unit Refutations in Horn Constraint Systems. LATA 2021: 226-237 - 2020
- [j13]K. Subramani
On integer closure in a system of unit two variable per inequality constraints. Ann. Math. Artif. Intell. 88(10): 1101-1118 (2020) - [j12]Hans Kleine Büning, Piotr Wojciechowski
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. Math. Struct. Comput. Sci. 30(7): 736-751 (2020) - [j11]Piotr Wojciechowski
Analyzing fractional Horn constraint systems. Theor. Comput. Sci. 844: 142-153 (2020) - [c24]Piotr Wojciechowski, K. Subramani:
On Unit Read-Once Resolutions and Copy Complexity. COCOA 2020: 273-288 - [c23]K. Subramani, Piotr Wojciechowski:
Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective. ISAIM 2020 - [c22]Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On Finding Shortest Paths in Arc-Dependent Networks. ISCO 2020: 249-260 - [c21]Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. IWOCA 2020: 395-408
2010 – 2019
- 2019
- [j10]K. Subramani
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. Algorithmica 81(7): 2765-2794 (2019) - [c20]K. Subramani, Piotr Wojciechowski:
A Graphical Analysis of Integer Infeasibility in UTVPI Constraints. AI*IA 2019: 223-234 - [c19]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
Read-Once Resolutions in Horn Formulas. FAW 2019: 100-110 - [c18]Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos 2019: 149-164 - [c17]Hans Kleine Büning, Piotr Wojciechowski
New Results on Cutting Plane Proofs for Horn Constraint Systems. FSTTCS 2019: 43:1-43:14 - [c16]K. Subramani, Piotr Wojciechowski:
Read-Once Certification of Linear Infeasibility in UTVPI Constraints. TAMC 2019: 578-593 - 2018
- [j9]James B. Orlin, K. Subramani
Randomized algorithms for finding the shortest negative cost cycle in networks. Discret. Appl. Math. 236: 387-394 (2018) - [j8]K. Subramani
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. J. Comb. Optim. 35(2): 389-408 (2018) - [j7]Hans Kleine Büning, Piotr Wojciechowski
Finding read-once resolution refutations in systems of 2CNF clauses. Theor. Comput. Sci. 729: 42-56 (2018) - [c15]K. Subramani, Piotr Wojciechowski, Zachary Santer, Matthew Anderson:
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. AAIM 2018: 111-123 - [c14]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski:
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM 2018: 45-58 - [c13]Piotr Wojciechowski, K. Subramani, Matthew D. Williamson:
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. FAW 2018: 300-314 - 2017
- [j6]K. Subramani
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints. Algorithmica 78(1): 166-208 (2017) - [j5]Piotr Wojciechowski
Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79(1-3): 245-266 (2017) - [j4]Piotr Wojciechowski
Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79(4): 371-392 (2017) - [c12]K. Subramani, Piotr Wojciechowski:
Analyzing Lattice Point Feasibility in UTVPI Constraints. CP 2017: 615-629 - [c11]Piotr Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani:
On a Generalization of Horn Constraint Systems. CSR 2017: 323-336 - [c10]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
The Complexity of Finding Read-Once NAE-Resolution Refutations. ICLA 2017: 64-76 - [c9]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. TAMC 2017: 362-372 - 2016
- [c8]Piotr Wojciechowski, K. Subramani, Pavlos Eirinakis:
On the computational complexities of Quantified Integer Programming variants. ISAIM 2016 - [c7]K. Subramani, Piotr Wojciechowski:
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints. IWOCA 2016: 321-333 - [c6]Vahid Hashemi
Compositional Bisimulation Minimization for Interval Markov Decision Processes. LATA 2016: 114-126 - [c5]Alvaro Velasquez, Piotr Wojciechowski
The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks. NCA 2016: 126-130 - [c4]K. Subramani, Piotr Wojciechowski:
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. WALCOM 2016: 154-165 - [i1]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the computational complexity of read once resolution decidability in 2CNF formulas. CoRR abs/1610.04523 (2016) - 2015
- [c3]K. Subramani, Piotr Wojciechowski:
A Graphical Theorem of the Alternative for UTVPI Constraints. ICTAC 2015: 328-345 - 2014
- [j3]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani
On quantified linear implications. Ann. Math. Artif. Intell. 71(4): 301-325 (2014) - [j2]Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani
On the complexity of quantified linear systems. Theor. Comput. Sci. 518: 128-134 (2014) - [c2]Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani:
Variants of Quantified Linear Programming and Quantified Linear Implication. ISAIM 2014 - 2012
- [j1]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani
A complexity perspective on entailment of parameterized linear constraints. Constraints An Int. J. 17(4): 461-487 (2012) - [c1]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski:
Computational complexity of inclusion queries over polyhedral sets. ISAIM 2012
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: