Accepted papers

• Kazumasa Shinagawa, Koji Nuida:
  Cyclic Equalizability of Words and Its Application to Card-Based Cryptography

• Michal Parnas, Adi Shraibman:
  A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank

• Joshua Grochow, Dan Johnson, Michael Levet:
  Complexity of Identifying Fitting-free Groups

• Tomoyuki Yamakami:
  Quantum First-Order Logics and Quantum Natural Deduction

• Michael Levet, Pranjal Srivastava, Dhara Thakkar:
  Complexity of Minimal Faithful Permutation Degree for Fitting-free Groups

• Tiziana Calamoneri, Federico Corò, Neeldhara Mishra, Saraswati Girish Nanoti, Giacomo Paesani:
  m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs

• Duncan Adamson, Pamela Fleischmann, Annika Huch, Florin Manea, Paul Sarnighausen-Cahn, Max Wiedenhöft:
  Tight Bounds for the Number of Absent Subsequences

• Justine Cauvi, Laurent Viennot:
  Parameterized Restless Temporal Path

• Takashi Horiyama, Kazuhisa Seto, Fumiya Sakamoto, Ryu Suzuki:
  Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3

• Tetiana Lavynska:
  Linear Time Algorithms for Colorful 3-Rainbow Domination in Block and Cactus Graphs

• Enrico Iurlano, Günther Raidl:
  Complexity of Positive Influence Domination on Partial Grids

• Robert Barish, Tetsuo Shibuya:
  Reconfiguring planar perfect matchings via bounded length alternating cycles

• Melanie Reihl, Jan Kratochvil:
  Simultaneous Contact Representations of Planar Graphs

• Dietrich Kuske:
  Disjointness, inclusion, and regularity of omega-rational trace languages

• Valentin Gledel, Gerold Jäger:
  Determining the Metric Dimension of Ka × Kb × Kc by Static Black-Peg Mastermind

• gennaro cordasco, Luisa Gargano, Adele Rescigno:
  Red-Blue Unshared Dominators

• Michael Itzhaki:
  Palindromes Combinatorics

• Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest:
  On the Exact & Approximate Complexity of Strongly Connected Steiner Subgraph On Two Terminals With Demands

• Jayalal Sarma, Kei Uchizawa:
  On Saving Energy in Boolean Circuits via Negations

• Susumu Kubo:
  Partially Ordered Sets Corresponding to the Partition Problem

• Ronak Bhadra, Raghunath Tewari:
  Inductive Tracing and the Complexity of finding Hamiltonian Path in DAGs

• Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Syuuya Yoshida:
  On the Complexity of Locally Rainbow Path

• Ankit Abhinav, Sriram Bhyravarapu, A. Mohanapriya, Saket Saurabh:
  On the Parameterized Complexity of Connected Cluster Vertex Deletion

• Wiktor Zuba, Oded Lachish, Solon P. Pissis:
  Minimizers in Semi-Dynamic Strings

• GiBeom Park, Mayank Goswami, Waldo Galvez, Arturo Merino, Meng-Tsung Tsai:
  Computing Diverse and Nice Triangulations

• Bireswar Das, Dipan Dey, Jinia Ghosh:
  On the Complexity of Problems on Graphs Defined on Groups

• Karthika D, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi, Pradeesha Ashok, Abidha V P:
  On the Parameterized Complexity of Cosecure Domination

• Ajinkya Gaikwad:
  Parameterized Algorithms for Editing to Uniform Cluster Graph

• Sandip Das, Soura Sena Das, Sweta Das, Sk Samim Islam:
  On distance-$d$ independent set problems for some graph classes

• Lukáš Holík, Ondřej Lengál, Juraj Major, Adéla Štěpková, Jan Strejček:
  On Complementation of Nondeterministic Finite Automata without Full Determinization

• Anoop S K M, Jayalal Sarma:
  Shallow-Rotation Distance via Forest Representations

• Konrad Dabrowski, Tala Eagling-Vose, Giacomo Paesani, Daniel Paulusma, Matthew Johnson:
  Finding d-Cuts in Probe H-Free Graphs

Contact

fct2025@cs.uni.wroc.pl