default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID48th SOFSEM 2023: Nový Smokovec, Slovakia
- Leszek Gasieniec:
SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings. Lecture Notes in Computer Science 13878, Springer 2023, ISBN 978-3-031-23100-1
Graphs Problems and Optimisation
- Oksana Firman
, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
The Complexity of Finding Tangles. 3-17 - Filippos Christodoulou, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs. 18-32 - Hauke Brinkop, Klaus Jansen:
Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. 33-46 - Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman:
More Effort Towards Multiagent Knapsack. 47-62
Graph Drawing and Visualization
- Giacomo Ortali, Ioannis G. Tollis:
Dominance Drawings for DAGs with Bounded Modular Width. 65-79 - Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. 80-95 - Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff:
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. 96-110 - Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. 111-125
NP-Hardness and Fixed Parameter Tractability
- Robert D. Barish, Tetsuo Shibuya:
Hardness of Bounding Influence via Graph Modification. 129-143 - Rica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon:
Heuristics for Opinion Diffusion via Local Elections. 144-158 - Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parameterized Complexity of s-club Cluster Deletion Problems. 159-173
SOFSEM 2023 Best Papers
- P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma:
Balanced Substructures in Bicolored Graphs. 177-191 - Klaus Jansen, Kai Kahler:
On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines. 192-206
SOFSEM 2023 Best Student Papers
- Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf:
On the 2-Layer Window Width Minimization Problem. 209-221 - Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. 222-235
Communication and Temporal Graphs
- Olav Bunte, Louis C. M. van Gool, Tim A. C. Willemse:
On the Preservation of Properties When Changing Communication Models. 239-253 - Christian Laforest, Timothée Martinod:
Introduction to Routing Problems with Mandatory Transitions. 254-266 - Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. 267-282 - Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf:
Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. 283-297
Complexity and Learning
- Andrzej Lingas:
Lower Bounds for Monotone q-Multilinear Boolean Circuits. 301-312 - Piotr Wojciechowski, K. Subramani:
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. 313-327 - Andris Ambainis, Ansis Zvirbulis:
Quantum Complexity for Vector Domination Problem. 328-341 - Avraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina, Hillel Kugler:
Learning Through Imitation by Using Formal Verification. 342-355
Robots and Strings
- Jared Ray Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce:
Delivery to Safety with Two Cooperating Robots. 359-371 - Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Space-Efficient STR-IC-LCS Computation. 372-384 - Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The k-Centre Problem for Classes of Cyclic Words. 385-400
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 2025-12-04 22:07 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:
