Browse by Academic Unit (A-Z)

A

Abrishami, T., Alecu, B. orcid.org/0000-0002-5515-9145, Chudnovsky, M. et al. (2 more authors) (2024) Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. Combinatorica, 44. pp. 921-948. ISSN 0209-9683

Abrishami, T., Alecu, B. orcid.org/0000-0002-5515-9145, Chudnovsky, M. et al. (2 more authors) (2024) Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. Journal of Combinatorial Theory, Series B, 164. pp. 443-472. ISSN 0095-8956

Abrishami, T., Alecu, B., Chudnovsky, M. et al. (3 more authors) (2023) Tree independence number I. (Even hole, diamond, pyramid)-free graphs. [Preprint]

Adler, I., Koehler, N. orcid.org/0000-0002-1023-6530 and Peng, P. (2024) On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM Journal on Computing (SICOMP), 53 (4). 825- 883. ISSN 0097-5397

Alecu, B. orcid.org/0000-0002-5515-9145, Alekseev, V.E., Atminas, A. et al. (2 more authors) (2023) Graph parameters, implicit representations and factorial properties. Discrete Mathematics, 346 (10). 113573. ISSN 0012-365X

Alecu, B. orcid.org/0000-0002-5515-9145, Atminas, A., Lozin, V. orcid.org/0000-0003-2464-7389 et al. (1 more author) (2023) Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica, 85 (3). pp. 642-664. ISSN 0178-4617

Alecu, B. orcid.org/0000-0002-5515-9145, Lozin, V. and Malyshev, D. (2024) Critical properties of bipartite permutation graphs. Journal of Graph Theory, 105 (1). pp. 34-60. ISSN 0364-9024

Alecu, B. orcid.org/0000-0002-5515-9145, Lozin, V.V., Quiroz, D.A. orcid.org/0000-0002-2479-0508 et al. (3 more authors) (2024) The Treewidth and Pathwidth of Graph Unions. SIAM Journal on Discrete Mathematics, 38 (1). pp. 261-276. ISSN 0895-4801

Aute, S. orcid.org/0009-0000-2964-0368 and Panolan, F. orcid.org/0000-0001-6213-8687 (2025) Parameterized algorithms for minimum sum vertex cover. Theoretical Computer Science, 1029. 115032. ISSN 0304-3975

Aute, S., Panolan, F. orcid.org/0000-0001-6213-8687, Saha, S. et al. (2 more authors) (2025) Parameterized Complexity of Generalizations of Edge Dominating Set. In: 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025). 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025), 20-23 Jan 2025, Bratislava, Slovakia. Lecture Notes in Computer Science, 15538 . Springer , Cham, Switzerland , pp. 65-79. ISBN 978-3-031-82669-6

B

Bandopadhyay, S., Banerjee, S., Majumdar, D. et al. (1 more author) (2024) Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. In: Proceedings of the 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024). 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024), 06-08 Dec 2024, Beijing, China. Lecture Notes in Computer Science . Springer . (In Press)

Belmonte, R., Harutyunyan, A., Köehler, N. orcid.org/0000-0002-1023-6530 et al. (1 more author) (2024) Odd chromatic number of graph classes. Journal of Graph Theory. ISSN 0364-9024

Bentert, M., Fomin, F.V., Golovach, P.A. et al. (6 more authors) (2025) Packing Short Cycles. In: Azar, Y. and Pangrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1425-1463. ISBN 978-1-61197-832-2

Bonnet, É, Chakraborty, D. orcid.org/0000-0003-0534-6417 and Duron, J. (2024) Cutting Barnette graphs perfectly is hard. Theoretical Computer Science, 1010. 114701. ISSN 0304-3975

Brand, C., Koutechý, M., Lassota, A. et al. (1 more author) (2024) Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. In: 32nd Annual European Symposium on Algorithms (ESA 2024). European Symposium on Algorithms (ESA 2024), 02-04 Sep 2024, Egham, UK. Leibniz International Proceedings in Informatics (LIPIcs), 308 . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , Wadern, Germany , 32:1-32:18. ISBN 978-3-95977-338-6

C

Chakraborty, D. orcid.org/0000-0003-0534-6417, Dailly, A., Das, S. et al. (3 more authors) (2022) Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022). 33rd International Symposium on Algorithms and Computation (ISAAC 2022), 19-21 Dec 2022, Seoul, Korea. Leibniz International Proceedings in Informatics (LIPIcs), 248 (12). Schloss Dagstuhl – LZI GmbH . ISBN 978-3-95977-258-7

Chakraborty, D. orcid.org/0000-0003-0534-6417, Dailly, A., Foucaud, F. et al. (1 more author) (2024) Algorithms and complexity for path covers of temporal DAGs. In: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). 49th International Symposium on Mathematical Foundations of Computer Science, 26-30 Aug 2024, Bratislava, Slovakia. Leibniz International Proceedings in Informatics (LIPIcs), 306 . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , Wadern, Germany , 38:1-38:17. ISBN 978-3-95977-335-5

Chakraborty, D. orcid.org/0000-0003-0534-6417, Feghali, C. and Mahmoud, R. (2024) Kempe equivalent list colorings revisited. Journal of Graph Theory, 107 (2). pp. 410-418. ISSN 0364-9024

Chakraborty, D. orcid.org/0000-0003-0534-6417 and Gajjar, K. (2022) Finding Geometric Representations of Apex Graphs is NP-Hard. In: WALCOM: Algorithms and Computation. 16th International Conference and Workshops, WALCOM 2022, 24-26 Mar 2022, Jember, Indonesia,. Lecture Notes in Computer Science, 13174 . Springer Nature , Cham, Switzerland , pp. 161-174. ISBN 9783030967307

Chakraborty, D., Müller, H., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2024) Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. In: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). 49th International Symposium on Mathematical Foundations of Computer Science, 26-30 Aug 2024, Bratislava, Slovakia. Leibniz International Proceedings in Informatics (LIPIcs) . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 39:1-39:14.

Cook, L., Horsfield, J., Preissmann, M. et al. (5 more authors) (2024) Graphs with all holes the same length. Journal of Combinatorial Theory, Series B, 168. pp. 96-158. ISSN 0095-8956

D

Dabrowski, K.K., Jonsson, P., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2025) Almost Consistent Systems of Linear Equations. ACM Transactions on Algorithms (TALG). ISSN 1549-6325 (In Press)

E

Eriksson, L., Lagerkvist, V., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (3 more authors) (2024) Solving Quantified Boolean Formulas with Few Existential Variables. In: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI 2024, 03-09 Aug 2024, Jeju Island, South Korea. IJCAI , California, USA , pp. 1889-1897. ISBN 978-1-956792-04-1

G

Ganian, R., Müller, H., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2024) A Tight Subexponential-time Algorithm for Two-Page Book Embedding. In: Bringmann, K., Grohe, M., Puppis, G. and Svensson, O., (eds.) 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). ICALP 2024, 08-12 Jul 2024, Tallinn, Estonia. Leibniz International Proceedings in Informatics (LIPIcs), 297 . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , Wadern, Germany , 68:1-68:18. ISBN 978-3-95977-322-5

Ghasemi Nezhad, S., Moghaddas, M. and Panolan, F. orcid.org/0000-0001-6213-8687 (2025) Fast FPT Algorithms for Grundy Number on Dense Graphs. In: Algorithms and Discrete Applied Mathematics 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings. 11th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2025), 13-15 Feb 2025, Coimbatore, Tamilnadu, India. Lecture Notes in Computer Science . Springer , Cham, Switzerland , pp. 160-172. ISBN 978-3-031-83437-0

Gupta, S., Inamdar, T., Jain, P. et al. (3 more authors) (2024) When far is better: The Chamberlin-Courant approach to obnoxious committee selection. In: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024), 16-18 Dec 2024, Gandhinagar, India. Leibniz International Proceedings in Informatics (LIPIcs), 323 . LIPIcs , Wadern, Germany , 24:1-24:21. ISBN 978-3-95977-355-3

H

Hanaka, T., Köhler, N. orcid.org/0000-0002-1023-6530 and Lampis, M. (2024) Core Stability in Additively Separable Hedonic Games of Low Treewidth. In: 35th International Symposium on Algorithms and Computation (ISAAC 2024). 35th International Symposium on Algorithms and Computation (ISAAC 2024), 08-11 Dec 2024, Sydney, Australia. Leibniz International Proceedings in Informatics (LIPIcs), 322 . Schloss Dagstuhl – Leibniz-Zentrum für Informatik , Wadern, Germany , 39:1-39:17. ISBN 978-3-95977-354-6

L

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (3 more authors) (2025) Crossing Number in Slightly Superexponential Time (Extended Abstract). In: Azar, Y. and Panigrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1412-1424. ISBN 978-1-61197-832-2

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2024) Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. In: In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). APPROX/RANDOM 2024, 28-30 Aug 2024, London. Leibniz International Proceedings in Informatics (LIPIcs), 317 . LIPIcs , Wadern, Germany , 6:1-6:14. ISBN 978-3-95977-348-5

M

Milanič, M., Penev, I., Pivač, N. et al. (1 more author) (2024) Bisimplicial separators. Journal of Graph Theory, 106 (4). pp. 816-842. ISSN 0364-9024

Mommessin, C., Erlebach, T. and Shakhlevich, N. V. orcid.org/0000-0002-5225-4008 (2025) Classification and evaluation of the algorithms for vector bin packing. Computers & Operations Research, 173. 106860. ISSN 0305-0548

O

Ordyniak, S. orcid.org/0000-0003-1935-651X, Paesani, G., Rychlicki, M. et al. (1 more author) (2024) Explaining Decisions in ML Models: a Parameterized Complexity Analysis. In: Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024). 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024), 02-08 Nov 2024, Hanoi, Vietnam. IJCAI Organization , pp. 563-573. ISBN 978-1-956792-05-8

Ordyniak, S. orcid.org/0000-0003-1935-651X, Schidler, A. and Szeider, S. (2024) Backdoor DNFs. Journal of Computer and System Sciences, 144. 103547. ISSN 0022-0000

P

Panolan, F. orcid.org/0000-0001-6213-8687, Mathew, R. and Seshikanth (2024) Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem. In: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024), 16-18 Dec 2024, Gandhinagar, India. Leibniz International Proceedings in Informatics (LIPIcs), 323 . LIPIcs , Wadern, Germany , 31:1-31:12. ISBN 978-3-95977-355-3

Panolan, F. orcid.org/0000-0001-6213-8687 and Yaghoubizade, H. (2025) On MAX–SAT with cardinality constraint. Theoretical Computer Science, 1025. 114971. ISSN 0304-3975