default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th CIAC 2023: Larnaca, Cyprus
- Marios Mavronicolas:
Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings. Lecture Notes in Computer Science 13898, Springer 2023, ISBN 978-3-031-30447-7 - Paul G. Spirakis
, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos:
Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models. 1-4 - Jannik Castenow, Jonas Harbig, Friedhelm Meyer auf der Heide:
Unifying Gathering Protocols for Swarms of Mobile Robots. 5-16 - Giuseppe Persiano:
The Complexity of Secure RAMs. 17-20 - Yaroslav Alekseev, Edward A. Hirsch:
The Power of the Binary Value Principle. 21-36 - Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue:
Independent Set Under a Change Constraint from an Initial Solution. 37-51 - Hagit Attiya, Noa Schiller:
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. 52-66 - Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time. 67-81 - Lorenzo Balzotti, Paolo Giulio Franciosa:
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow. 82-96 - Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler, Yishai Oltchik:
Maximum Flows in Parametric Graph Templates. 97-111 - Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
Dynamic Coloring on Restricted Graph Classes. 112-126 - Ivan Bliznets, Danil Sagunov, Eugene Tagin:
Enumeration of Minimal Tropical Connected Sets. 127-141 - Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder:
Dynamic Flows with Time-Dependent Capacities. 142-156 - Nader H. Bshouty:
On One-Sided Testing Affine Subspaces. 157-171 - Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. 172-186 - Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N:
Parameterizing Path Partitions. 187-201 - Simon D. Fink, Ignaz Rutter:
Maintaining Triconnected Components Under Node Expansion. 202-216 - Toshihiro Fujito, Kneto Mukae, Junya Tsuzuki:
Approximating Power Node-Deletion Problems. 217-231 - Éric Fusy, Gregory Kucherov:
Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates. 232-246 - Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer:
Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane. 247-262 - Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. 263-277 - Hovhannes A. Harutyunyan, Narek A. Hovhannisyan:
Broadcasting in Split Graphs. 278-292 - Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning Subclasses of Chordal Graphs with Few Deletions. 293-307 - Pascal Koiran, Subhayan Saha:
Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision. 308-322 - Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam:
Improved Deterministic Leader Election in Diameter-Two Networks. 323-335 - Victor Y. Pan, Soo Go, Qi Luan, Liang Zhao:
Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues. 336-352 - Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach:
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. 353-367 - Muhammad Nur Yanhaona, Asswad Sarker Nomaan, Md. Saidur Rahman:
Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended Abstract). 368-382 - Chun Jiang Zhu:
Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models. 383-398
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-02-25 23:34 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:
