Login / Signup
CIAC
1994
2004
2009
2023
1994
2023
Keyphrases
Publications
2023
Éric Fusy
,
Gregory Kucherov
Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates.
CIAC
(2023)
Hagit Attiya
,
Noa Schiller
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model.
CIAC
(2023)
Costas Busch
,
Bogdan S. Chlebus
,
Dariusz R. Kowalski
,
Pavan Poudel
Stable Scheduling in Transactional Memory.
CIAC
(2023)
Yuichi Asahiro
,
Hiroshi Eto
,
Kana Korenaga
,
Guohui Lin
,
Eiji Miyano
,
Reo Nonoue
Independent Set Under a Change Constraint from an Initial Solution.
CIAC
(2023)
Simon D. Fink
,
Ignaz Rutter
Maintaining Triconnected Components Under Node Expansion.
CIAC
(2023)
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.
CIAC
(2023)
Nader H. Bshouty
On One-Sided Testing Affine Subspaces.
CIAC
(2023)
Tesshu Hanaka
,
Hirotaka Ono
,
Yota Otachi
,
Saeki Uda
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond.
CIAC
(2023)
Hovhannes A. Harutyunyan
,
Narek Hovhannisyan
Broadcasting in Split Graphs.
CIAC
(2023)
Chun Jiang Zhu
Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models.
CIAC
(2023)
Yaroslav Alekseev
,
Edward A. Hirsch
The Power of the Binary Value Principle.
CIAC
(2023)
Lorenzo Balzotti
,
Paolo Giulio Franciosa
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time.
CIAC
(2023)
Thomas Bläsius
,
Adrian Feilhauer
,
Jannik Westenfelder
Dynamic Flows with Time-Dependent Capacities.
CIAC
(2023)
Henning Fernau
,
Florent Foucaud
,
Kevin Mann
,
Utkarsh Padariya
,
Rajath Rao K. N
Parameterizing Path Partitions.
CIAC
(2023)
Paul G. Spirakis
,
Sotiris E. Nikoletseas
,
Christoforos L. Raptopoulos
Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models.
CIAC
(2023)
Satyabrata Jana
,
Souvik Saha
,
Abhishek Sahu
,
Saket Saurabh
,
Shaily Verma
Partitioning Subclasses of Chordal Graphs with Few Deletions.
CIAC
(2023)
Toshihiro Fujito
,
Kneto Mukae
,
Junya Tsuzuki
Approximating Power Node-Deletion Problems.
CIAC
(2023)
Muhammad Nur Yanhaona
,
Asswad Sarker Nomaan
,
Md. Saidur Rahman
Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended Abstract).
CIAC
(2023)
Manish Kumar
,
Anisur Rahaman Molla
,
Sumathi Sivasubramaniam
Improved Deterministic Leader Election in Diameter-Two Networks.
CIAC
(2023)
Victor Y. Pan
,
Soo Go
,
Qi Luan
,
Liang Zhao
Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues.
CIAC
(2023)
Giuseppe Persiano
The Complexity of Secure RAMs.
CIAC
(2023)
Lorenzo Balzotti
,
Paolo Giulio Franciosa
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow.
CIAC
(2023)
Kerem Geva
,
Matthew J. Katz
,
Joseph S. B. Mitchell
,
Eli Packer
Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane.
CIAC
(2023)
Pascal Koiran
,
Subhayan Saha
Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision.
CIAC
(2023)
Sriram Bhyravarapu
,
Swati Kumari
,
I. Vinod Reddy
Dynamic Coloring on Restricted Graph Classes.
CIAC
(2023)
Ivan Bliznets
,
Danil Sagunov
,
Eugene Tagin
Enumeration of Minimal Tropical Connected Sets.
CIAC
(2023)
Tal Ben-Nun
,
Lukas Gianinazzi
,
Torsten Hoefler
,
Yishai Oltchik
Maximum Flows in Parametric Graph Templates.
CIAC
(2023)
Jannik Castenow
,
Jonas Harbig
,
Friedhelm Meyer auf der Heide
Unifying Gathering Protocols for Swarms of Mobile Robots.
CIAC
(2023)
volume 13898, 2023
Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings
CIAC
13898 (2023)
2021
Hugo A. Akitaya
,
Matias Korman
,
Oliver Korten
,
Diane L. Souvaine
,
Csaba D. Tóth
Reconfiguration of Connected Graph Partitions via Recombination.
CIAC
(2021)
Martin Böhm
,
Nicole Megow
,
Jens Schlöter
Throughput Scheduling with Equal Additive Laxity.
CIAC
(2021)
Henning Fernau
,
Katharina T. Huber
,
Joseph (Seffi) Naor
Invited Talks.
CIAC
(2021)
Tatsuya Gima
,
Tesshu Hanaka
,
Masashi Kiyomi
,
Yasuaki Kobayashi
,
Yota Otachi
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.
CIAC
(2021)
Barnaby Martin
,
Daniël Paulusma
,
Siani Smith
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles.
CIAC
(2021)
Joachim Gudmundsson
,
Mees van de Kerkhof
,
André van Renssen
,
Frank Staals
,
Lionov Wiratma
,
Sampson Wong
Covering a Set of Line Segments with a Few Squares.
CIAC
(2021)
Jungho Ahn
,
Lars Jaffke
,
O-joung Kwon
,
Paloma T. Lima
Three Problems on Well-Partitioned Chordal Graphs.
CIAC
(2021)
Rajesh Chitnis
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs.
CIAC
(2021)
Saeed Akhoondian Amiri
,
Ben Wiederhake
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs.
CIAC
(2021)
Till Fluschnik
A Multistage View on 2-Satisfiability.
CIAC
(2021)
Steven Chaplick
,
Philipp Kindermann
,
Jonathan Klawitter
,
Ignaz Rutter
,
Alexander Wolff
Extending Partial Representations of Rectangular Duals with Given Contact Orientations.
CIAC
(2021)
Guilherme de Castro Mendes Gomes
,
Vinícius Fernandes dos Santos
,
Murilo V. G. da Silva
,
Jayme Luiz Szwarcfiter
FPT and Kernelization Algorithms for the Induced Tree Problem.
CIAC
(2021)
Frank Fuhlbrück
,
Johannes Köbler
,
Ilia Ponomarenko
,
Oleg Verbitsky
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties.
CIAC
(2021)
Timothe Picavet
,
Ngoc-Trung Nguyen
,
Binh-Minh Bui-Xuan
Temporal Matching on Geometric Graph Data.
CIAC
(2021)
Katrin Casel
,
Henning Fernau
,
Mehdi Khosravian Ghadikolaei
,
Jérôme Monnot
,
Florian Sikora
Abundant Extensions.
CIAC
(2021)
Aleksander Figiel
,
Anne-Sophie Himmel
,
André Nichterlein
,
Rolf Niedermeier
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering.
CIAC
(2021)
Francesco Cellinese
,
Gianlorenzo D'Angelo
,
Gianpiero Monaco
,
Yllka Velaj
The Multi-budget Maximum Weighted Coverage Problem.
CIAC
(2021)
Prosenjit Bose
,
Pilar Cano
,
Rolf Fagerberg
,
John Iacono
,
Riko Jacob
,
Stefan Langerman
Fragile Complexity of Adaptive Algorithms.
CIAC
(2021)
Katharina T. Huber
Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes.
CIAC
(2021)
Pallavi Jain
,
Lawqueen Kanesh
,
Shivesh Kumar Roy
,
Saket Saurabh
,
Roohani Sharma
Circumventing Connectivity for Kernelization.
CIAC
(2021)
volume 12701, 2021
Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings
CIAC
12701 (2021)