default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID51st SOFSEM 2026: Kraków, Poland
- Jakub Kozik
, Alexander Wolff:
SOFSEM 2026: Theory and Practice of Computer Science - 51st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2026, Kraków, Poland, February 9-13, 2026, Proceedings. Lecture Notes in Computer Science 16448, Springer 2026, ISBN 978-3-032-17800-8 - Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad, Naomi Nishimura:
On the Complexity of Constrained Reconfiguration and Motion Planning. 1-15 - Souta Kobayashi, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries. 16-30 - Nader H. Bshouty:
Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction. 31-45 - Kei Kimura:
Towards an Algebraic Approach to the Reconfiguration CSP. 46-60 - Yoshihiro Maruyama:
Algorithms and Complexity Results for K-Theoretic Persistent Homology. 61-74 - Anuran Maity, Kanduru V. Krishna:
Mutually Abelian-Bordered Binary Words. 75-89 - Tithi Dwary, Kanduru V. Krishna:
Minimum Length Word-Representants of Treelike Permutation Graphs. 90-103 - Kehinde Adeogun, Christos Kapoutsis:
A Quadratic Lower Bound for 2dfas Against One-Way Liveness. 104-116 - Arthur Mittelstaedt, Gaétan Richard:
Vertical-Horizontal Full Compatibility of One-Dimensional Subshifts. 117-127 - Michael Itzhaki:
Asymptotically Optimal Representation of Palindromic Structure. 128-143 - Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede:
On the Order-Diameter Ratio of Girth-Diameter Cages. 144-156 - Kevin Mann:
Enumeration With Nice Roman Domination Properties. 157-171 - Christian Komusiewicz, Diptapriyo Majumdar:
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. 172-186 - Jannik Schestag:
Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder. 187-202 - Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl:
A Practical Algorithm for 3-Admissibility. 203-215 - Therese Biedl, Prashant Gokhale:
Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs. 216-230 - Shion Fukuzawa, Michael T. Goodrich, Sandy Irani:
Sublinear Work Parallel Quantum Algorithms for Computational Geometry. 231-245 - Erwin Glazenburg, Frank Staals:
On Strictly Output-Sensitive Color Frequency Reporting. 246-259 - Steven Miltenburg, Tim Oosterwijk, René Sitters:
On the Complexity of Capacitated Vehicle Routing with Order Restrictions. 260-273 - Nicolas El Maalouly, Kostas Lakis:
Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth. 274-287 - Matthias Bentert, Pål Grønås Drange, Erlend Haugen:
Overlapping Biclustering. 288-302 - Tesshu Hanaka, Hironori Kiya, Hirotaka Ono:
Finding a HIST: Chordality, Structural Parameters, and Diameter. 303-316 - Ajinkya Gaikwad, Soumen Maity, Saket Saurabh:
Parameterized Algorithms for Locally Minimal Defensive Alliance. 317-331 - Sebastian Bruchhold, Mathias Weller:
Exploiting Low Scanwidth to Resolve Soft Polytomies. 332-346 - Oren Weimann, Raphael Yuster:
Maintaining a Kingdom in a Tournament. 347-360 - Kunanon Burathep, Thomas Erlebach, William K. Moses Jr.:
Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model. 361-375 - Hikaru Manabe, Ryohei Miyadera, Koki Suetsugu:
On the Sprague-Grundy Values of Games with a Pass. 376-389 - Yoshihiro Maruyama:
Reverse Mathematics for Neural Networks. 390-403 - Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe:
Private Graph Colouring with Limited Defectiveness. 404-415 - Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski:
Complexity Aspects of Homomorphisms of Ordered Graphs. 416-431 - Rin Saito, Anouk Sommer, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura:
Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set. 432-446 - Kristina Asimi, Tala Eagling-Vose, Santiago Guzmán-Pro, Barnaby Martin, Yiming Qiu:
Quantified Colouring and H-Free Algorithmics. 447-460 - Shiwali Gupta, Rogers Mathew:
Bounds and Hardness Results for Conflict-Free Choosability. 461-474 - Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski:
The Rectilinear Steiner Forest Arborescence. 475-490 - Therese Biedl:
Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm. 491-504 - Petr Hlinený, Jan Jedelský:
k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. 505-516 - Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen G. Kobourov, Johannes Zink:
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs. 517-531 - Todor Antic, Aleksa Dzuklevski, Jirí Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink:
Edge-Constrained Hamiltonian Paths on a Point Set. 532-546 - Nadym Mallek, Kirill Simonov:
Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes. 547-562 - Katarzyna E. Paluch, Mateusz Wasylkiewicz:
Clique-Free t-Matchings in Degree-Bounded Graphs. 563-577 - Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou:
Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes. 578-592 - Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl:
Efficient Trace Frequency Queries in Sparse Graphs. 593-606 - Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl:
Counting Large Patterns in Degenerate Graphs. 607-620 - Hiroshi Fujiwara, Kota Miyagi, Katsuhisa Ouchi:
Pinwheel Scheduling with Real Periods. 621-633 - Yosuke Kusano:
Limitations of Density-Based Heuristics and an Alternative Approach for Pinwheel Scheduling with Durations. 634-647 - Adam Ganczorz, Tomasz Jurdzinski:
Optimal-Length Labeling Schemes and Fast Algorithms for k-Gathering and k-Broadcasting. 648-662 - Sampriti Roy:
Distribution Testing Meets Sum Estimation. 663-677 - Niklas Haas, Sören Schmitt, Rob van Stee:
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts. 678-692
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.
last updated on 2026-02-26 22:53 CET 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:
