Instytut Informatyki Analitycznej - lista publikacji

Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth, Electronic Journal of Combinatorics (2022),

Further extensions of Grötzsch Theorem, Discrete Mathematics (2022),

2-distance list (Δ+2)-coloring of planar graphs with girth at least 10, Journal of Combinatorial Optimization (2022),

2-distance list (Δ + 3)-coloring of sparse graphs, Graphs and Combinatorics (2022),

Improved bounds for weak coloring numbers, Electronic Journal of Combinatorics vol. Volume 29, Issue 1 (2022), P1.60

Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget, European Symposium on Algorithms [ESA], European Symposium on Algorithms [ESA], (2022), 25:1-25:14

A Polynomial Kernel for Bipartite Permutation Vertex Deletion, Algorithmica vol. 84 (2022), 3246-3275

Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming, International Colloquium on Automata Languages and Programming [ICALP], (2022), 29:1-29:20

A solution to Ringel's circle problem, International Symposium on Computational Geometry [SoCG] vol. 224 of Leibniz International Proceedings in Informatics (LIPIcs) (2022), 33:1-33:14

Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms, Artificial Intelligence vol. 309 (2022), 103711

Weighted 2-sections and hypergraph reconstruction, Theoretical Computer Science vol. 915 (2022), 11-25

Infinite chromatic games, Discrete Applied Mathematics vol. 309 (2022), 138-146

Satisfiability in multi-valued circuits , SIAM Journal on Computing vol. 51(3) (2022), 337-378

Complexity of Modular Circuits, IEEE Symposium on Logic in Computer Science [LICS] vol. LICS'22; Proc. of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (2022), 32:1-32:11

Satisfiability problems for finite groups, International Colloquium on Automata Languages and Programming [ICALP](MAIN) vol. 229 (2022), 20

Satisfiability of Circuits and Equations over Finite Malcev Algebras, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. STACS'22; Proc. of the 39th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022), 37:1-37:14

Graph Polynomials and Group Coloring of Graphs, European Journal of Combinatorics vol. 102 (2022), 103505

A tight bound for shortest augmenting paths on trees, Theoretical Computer Science vol. 901 (2022), 45-61

Excludding a Ladder, Combinatorica vol. 42 (2022), 405–432

Vertex Deletion into Bipartite Permutation Graphs, Algorithmica vol. 84 (2022), 2271-2291

Clustered 3-colouring graphs of bounded degree, Combinatorics Probability and Computing vol. 31 (2022), 123-135

Degeneracy of P_t-free and C_(≥t)-free graphs with no large complete bipartite subgraphs, Journal of Combinatorial Theory. Series B vol. 152 (2022), 353-378

Combinatorial Gap Theorem and Reductions between Promise CSPs, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2022), pp.1204 - 1220