ICALP INVITED SPEAKERS
Anuj Dawar
University of Cambridge
Danupon Nanongkai
MPI Saarbrücken
Merav Parter
Weizmann Institute
FSCD INVITED SPEAKERS
Delia Kesner
Université Paris Cité
Bettina Könighofer
TU Graz
Sebastian Ullrich
LEAN-FRO and Karlsruhe Institute of Technology
ICALP 2024
51st EATCS International Colloquium on Automata, Languages and Programming
ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). ICALP 2024 will be preceded by a series of workshops, which will take place on July 7, 2024.
ICALP 2024 is organized by the Department of Software Science, Tallinn University of Technology, in cooperation with the European Association for Theoretical Computer Science (EATCS).
The first ICALP conference was organized in 1972. For more information about previous editions, see the EATCS webpage http://eatcs.org/index.php/international-colloquium.
Important dates
- Submissions: February 14, 2024 at 1pm CET
- Rebuttal: March 26-29, 2024
- Author notification: April 14, 2024
- Camera-ready version: April 28, 2024
- Early registration: May 17, 2024
- Conference: July 8-12, 2024
- ICALP Workshops: July 6-7, 2024
Submissions
Paper submissions are handled via Easychair.
1) Papers must present original research on the theory of computer science. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Authors are encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC.
2) Submissions take the form of an extended abstract of no more than 15 pages, excluding references and a clearly labelled appendix. The appendix may consist either of omitted proofs or of a full version of the submission, and it will be read at the discretion of program committee members. The use of the LIPIcs document class is an option, but not required. The extended abstract has to present the merits of the paper and its main contributions clearly, and describe the key concepts and technical ideas used to obtain the results. Submissions must provide the proofs which can enable the main mathematical claims of the paper to be verified.
3) Submissions are anonymous. The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. Authors should ensure that any references to their own related work are in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”).
The purpose of this double-blind process is to help PC members and external reviewers come to an initial judgment about the paper without bias, and not to make it impossible for them to discover who the authors are if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas.
4) Submissions authored or co-authored by members of the program committee are allowed.
5) The submissions are done via Easychair to the appropriate track of the conference (see topics below). The use of pdflatex or similar pdf generating tools is mandatory and the page limit is strict (see point 2.) Papers that deviate significantly from these requirements risk rejection without consideration of merit.
6) During the rebuttal phase, authors will have from March 26-29, 2024 to view and respond to initial reviews. Further instructions will be sent to authors of submitted papers before that time.
7) At least one author of each accepted paper is expected to register for the conference, and all talks are in-person. In exceptional cases, there may be support for remotely presenting a talk.
8) Papers authored only by students should be marked as such upon submission in order to be eligible for the best student paper awards of the track.
SafeToC
ICALP has joined http://safetoc.org.
Participants have to follow the ICALP code of conduct.
The ICALP 2024 SafeToc advocate is Diana Kessler.
ICALP TRACKS
Papers presenting original research on all aspects of theoretical computer science are sought. Typical, but not exclusive, topics of interest are:
Track A
`Algorithms, Complexity and Games
- Algorithmic and Complexity Aspects of Network Economics
- Algorithmic Aspects of Biological and Physical Systems
- Algorithmic Aspects of Networks and Networking
- Algorithmic Aspects of Security and Privacy
- Algorithmic Game Theory and Mechanism Design
- Approximation and Online Algorithms
- Combinatorial Optimization
- Combinatorics in Computer Science
- Computational Complexity
- Computational Geometry
- Computational Learning Theory
- Cryptography
- Data Structures
- Design and Analysis of Algorithms
- Distributed and Mobile Computing
- Foundations of Machine Learning
- Graph Mining and Network Analysis
- Parallel and External Memory Computing
- Parameterized Complexity
- Quantum Computing
- Randomness in Computation
- Sublinear Time and Streaming Algorithms
- Theoretical Foundations of Algorithmic Fairness
Track B
Automata, Logic, Semantics, and Theory of Programming
- Algebraic and Categorical Models of Computation
- Automata, Logic, and Games
- Database Theory, Constraint Satisfaction Problems, and Finite Model Theory
- Formal and Logical Aspects of Learning
- Formal and Logical Aspects of Security and Privacy
- Logic in Computer Science and Theorem Proving
- Models of Computation: Complexity and Computability
- Models of Concurrent, Distributed, and Mobile Systems
- Models of Reactive, Hybrid, and Stochastic Systems
- Principles and Semantics of Programming Languages
- Program Analysis, Verification, and Synthesis
- Type Systems and Typed Calculi
Accepted papers
Track A
Kernelization Dichotomies for Hitting Subgraphs under Structural ParameterizationsA Faster Algorithm for Pigeonhole Equal SumsRefuting approaches to the log-rank conjecture for XOR functionsOn the Smoothed Complexity of Combinatorial Local SearchLower Bounds on 0-Extension with Steiner NodesTowards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix ParametersTwo-sets cut-uncut on planar graphsStreaming Edge Coloring with Subquadratic Palette SizePath-Reporting Distance Oracles with Logarithmic Stretch and Linear SizeLinear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided ErrorLipschitz Continuous Allocations for Optimization GamesBayesian Calibrated Click-Through AuctionsSubexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete ClassificationSubquadratic Submodular Maximization with a General Matroid ConstraintBQP, meet NP: Search-to-decision reductions and approximate countingTowards an Analysis of Quadratic ProbingAlphabet Reduction for Reconfiguration ProblemsTwo Choices are Enough for P-LCPs, USOs, and Colorful TangentsParameterized Algorithms for Steiner Forest in Bounded Width GraphsThe k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k > 5Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity OraclesSolution discovery via reconfiguration for problems in PAlmost-Tight Bounds on Preserving Cuts in Classes of Submodular HypergraphsCaching Connections in MatchingsTreewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced MinorStreaming Algorithms for Connectivity AugmentationOn the cut-query complexity of approximating max-cutNo Polynomial Kernels for KnapsackÕptimal Dynamic Time Warping on Run-Length Encoded StringsOptimal PSPACE-hardness of Approximating Set Cover ReconfigurationFaster Algorithms for Dual-Failure Replacement PathsAlgorithms for the Generalized Poset Sorting ProblemThe Group Access Bounds for Binary Search TreesRobot positioning using torus packing for multisetsDelineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of SurfacesA Sublinear Time Tester for Max-Cut on Clusterable GraphsCut Sparsification and Succinct Representation of Submodular HypergraphsSolving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic GamesVertex-minor universal graphs for generating entangled quantum subsystemsTesting Spreading Behavior in Networks with Arbitrary TopologiesA Characterization of Complexity in Public Goods GamesSplitting-off in HypergraphsOracle-Augmented Prophet InequalitiesDynamic PageRank: Algorithms and Lower BoundsThe Bit Complexity of Dynamic Algebraic Formulas and their DeterminantsApproximation Algorithms for lp-Shortest Path and lp-Group Steiner TreeFully Dynamic Strongly Connected Components in Planar DigraphsDetecting Disjoint Shortest Paths in Linear Time and MoreLimits of Sequential Local Algorithms on the Random k-XORSAT ProblemApproximate counting for spin systems in sub-quadratic timeRandom Separating Hyperplane Theorem and Learning PolytopesNew Tradeoffs for Decremental Approximate All-Pairs Shortest PathsA Multivariate to Bivariate Reduction for Noncommutative Rank and Related ResultsImproved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETHFully-Scalable MPC Algorithms for Clustering in High DimensionComputing Tree Decompositions with Small Independence NumberAnother Hamiltonian cycle in bipartite Pfaffian graphsExploiting Automorphisms of Temporal Graphs for Fast Exploration and RendezvousList Update with Delays or Time WindowsConstrained Level Planarity is FPT with Respect to the Vertex Cover NumberAn FPRAS for two terminal reliability in directed acyclic graphsIsomorphism for Tournaments of Small Twin WidthOptimal Non-Adaptive Cell Probe Dictionaries and HashingA Tight Subexponential Algorithm for Two-Page Book EmbeddingFundamental Problems on Bounded-Treewidth Graphs: The Real Source of HardnessFast Approximate Counting of CyclesBreaking a Barrier in Constructing Compact Indexes for Parameterized Pattern MatchingOptimal Electrical Oblivious Routing on ExpandersPolylogarithmic Approximations for Robust s-t PathAdaptive sparsification for matroid intersectionBetter Sparsifiers for Directed Eulerian GraphsA Note on Approximating Weighted Nash Social Welfare with Additive ValuationsAn improved integrality gap for disjoint cycles in planar graphsTesting Ck-freeness in bounded-arboricity graphsExponential lower bounds via exponential sumsOn the Space Usage of Approximate Distance Oracles with Sub-2 StretchFiner-grained Reductions in Fine-grained Hardness of ApproximationLower Bounds for Matroid Optimization Problems with a Linear ConstraintOne-Way Communication Complexity of Partial XOR FunctionsAn O(loglog n)-Approximation for Submodular Facility LocationSharp Noisy Binary Search with Monotonic ProbabilitiesDecremental Matching in General Weighted GraphsBetter space-time-robustness trade-offs for set reconciliationSimultaneously Approximating All lp-norms in Correlation ClusteringSublinear Algorithms for TSP via Path CoversNearly optimal independence oracle algorithms for edge estimation in hypergraphsFrom Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSPOracle separation of QMA and QCMA with bounded adaptivityLow-Memory Algorithms for Online Edge ColoringParameterized Algorithms for Coordinated Motion Planning: Minimizing EnergyAn Optimal Sparsification Lemma for Low-Crossing Matchings and its ApplicationsTight Bounds on Adjacency Labels for Monotone Graph ClassesParallel and Sequential Hardness of Hierarchical Graph ClusteringAn improved Quantum Max Cut approximation via Maximum MatchingProblems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex CoverStreaming Edge Coloring with Asymptotically Optimal ColorsDistributed fast crash-tolerant consensus with nearly-linear quantum communicationThe Discrepancy of Shortest PathsA spectral approach to approximately counting independent sets in dense bipartite graphsTwo-Source and Affine Non-Malleable Extractors for Small EntropyNP-hardness of testing equivalence to sparse polynomials and constant support polynomialsBetter Decremental and Fully Dynamic Sensitivity Oracles for Subgraph ConnectivityFrom Proof Complexity to Circuit Complexity via Interactive ProtocolsFinding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear TimeHigh-Accuracy Multicommodity Flows via Iterative RefinementAdditive Spanner Lower Bounds with Optimal Inner Graph StructureImpagliazzo's Worlds Through the Lens of Conditional Kolmogorov ComplexityOptimal Bounds for Distinct QuarticsNon-Linear PagingA tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-widthMinimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex SetsApproximation Schemes for Geometric Knapsack for Packing Spheres and Fat ObjectsLearning low-degree quantum objectsMinimizing Tardy Processing Time on a Single Machine in Near-Linear TimeProblems on Group-labeled Matroid BasesParameterized Approximation for Robust Clustering in Discrete Geometric SpacesQuantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing ProblemsOn the Streaming Complexity of Expander DecompositionSatisfiability to Coverage in Presence of Fairness, Matroid, and Global ConstraintsBounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle
Track B
On the Length of Strongly Monotone Descending Chains over ℕᵈSolving promise equations over monoids and groupsAutomata-Theoretic Characterisations of Branching-Time Temporal LogicsThe Threshold Problem for Hypergeometric Sequences with Quadratic ParametersFinite-memory Strategies for Almost-sure Energy-MeanPayoff Objectives in MDPsFO logic on cellular automata orbits equals MSO logicImproved Algorithm for Reachability in d-VASSFunctional Closure Properties of Finite N-weighted AutomataDomain Reasoning In TopKATFlattability of Priority Vector Addition SystemsIdentifying Tractable Quantified Temporal Constraints within Ord-HornInteger Linear-Exponential Programming in NP by Quantifier EliminationAn order out of nowhere: a new algorithm for infinite-domain CSPsOn Homomorphism Indistinguishability and Hypertree DepthThe complexity of computing in continuous time: space complexity is precisionSmoothed analysis of deterministic discounted and mean-payoff gamesA Complete Quantitative Axiomatisation of Behavioural Distance of Regular ExpressionsDecidability of Graph Neural Networks via Logical CharacterizationsThe structure of trees in the pushdown hierarchyLookahead Games and Efficient Determinisation of History-Deterministic Büchi AutomataOn Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy WordsHomogeneity and Homogenizability: Hard Problems for the Logic SNPA finite presentation of treewidth at most 3 graphsForcing, Transition Algebras, and CalculiOn classes of bounded tree rank, their interpretations, and efficient sparsificationRegular Expressions with Backreferences and Lookaheads Capture NLOGDeciding Linear Height and Linear Size-to-Height Increase of Macro Tree TransducersEdit Distance of Finite State TransducersAn efficient quantifier elimination procedure for Presburger arithmeticT-Rex: Termination of Recursive Functions using Lexicographic Linear CombinationsVerification of Population Protocols with Unordered DataThe 2-Dimensional Constraint Loop Problem is DecidableSeparability in Büchi Vass and Singly Non-Linear Systems of InequalitiesFunction spaces for orbit-finite sets
ICALP COMMITTEES
Conference chair
Pawel Sobocinski (Tallinn UoT)
Organising committee
- Niccolò Veltri (Tallinn University of Technology)
- Amar Hadzihasanovic (Tallinn University of Technology)
- Fosco Loregian (Tallinn University of Technology)
- Matt Earnshaw (Tallinn University of Technology)
- Diana Kessler (Tallinn University of Technology)
- Ekaterina Zhuchko (Tallinn University of Technology)
- Juhan Ernits (Tallinn University of Technology)
- Kristi Ainen (Tallinn University of Technology)
- Arianna Jater (Tallinn University of Technology)
- Mariann Lugus (Tallinn University of Technology)
Proceedings chair
Gabriele Puppis (University of Udine, Italy)
Workshop chairs
- Valentin Blot (ENS Paris-Saclay)
- Valia Mitsou (IRIF, University Paris Cité)
- Ekaterina Zhuchko (Tallinn University of Technology)
Programme Commitee (Track A)
Chairs: Karl Bringmann (Saarland University, Germany) and Ola Svensson (EPFL, Switzerland)
- Nima Anari (Stanford University)
- Karl Bringmann (co-chair, Saarland University)
- Parinya Chalermsook (Aalto University)
- Vincent Cohen-Addad (Google Research)
- Jose Correa (Universidad de Chile)
- Holger Dell (Goethe University Frankfurt)
- Ilias Diakonikolas (University of Wisconsin-Madison)
- Yuval Filmus (Technion)
- Arnold Filtser (Bar Ilan University)
- Naveen Garg (IIT Delhi)
- Pawel Gawrychowski (University of Wrocław)
- Anupam Gupta (Carnegie Mellon University)
- Samuel Hopkins (MIT)
- Sophie Huiberts (Columbia University)
- Giuseppe Italiano (LUISS University)
- Michael Kapralov (EPFL)
- Eun Jung Kim (Université Paris-Dauphine)
- Sándor Kisfaludi-Bak (Aalto University)
- Tomasz Kociumaka (Max-Planck-Institute for Informatics)
- Fabian Kuhn (University of Freiburg)
- Amit Kumar (IIT Delhi)
- William Kuszmaul (Harvard University)
- Rasmus Kyng (ETH Zurich)
- Kasper Green Larsen (Aarhus University)
- François Le Gall (Nagoya University)
- Pasin Manurangsi (Google Research)
- Daniel Marx (CISPA Helmholtz Center for Information Security)
- Yannic Maus (TU Graz)
- Nicole Megow (University of Bremen)
- Ruta Mehta (University of Illinois at Urbana-Champaign)
- Jakob Nordström (University of Copenhagen)
- Richard Peng (University of Waterloo)
- Seth Pettie (University of Michigan)
- Adam Polak (Bocconi University)
- Lars Rohwedder (Maastricht University)
- Eva Rotenberg (DTU Compute)
- Sushant Sachdeva (University of Toronto)
- Melanie Schmidt (University of Cologne)
- Sebastian Siebertz (University of Bremen)
- Shay Solomon (Tel Aviv University)
- Nick Spooner (University of Warwick)
- Clifford Stein (Columbia University)
- Ola Svensson (co-chair, EPFL)
- Luca Trevisan (Bocconi University)
- Ali Vakilian (Toyota Technological Institute Chicago)
- Jan van den Brand (Georgia Tech)
- Erik Jan van Leeuwen (Utrecht University)
- Oren Weimann (University of Haifa)
- Nicole Wein (University of Michigan)
- Andreas Wiese (TU Munich)
- John Wright (UC Berkeley)
Programme Committee (Track B)
Chair: Martin Grohe (RWTH Aachen University)
- Arnold Beckmann (Swansea University)
- Manuel Bodirsky (TU Dresden)
- Patricia Bouyer (CNRS, LMF)
- Yijia Chen (Shanghai Jiao Tong University)
- Victor Dalmau (Universitat Pompeu Fabra)
- Laurent Doyen (CNRS, LMF)
- Marcelo Fiore (Cambridge University)
- Stefan Göller (University of Kassel)
- Martin Grohe (RWTH Aachen University, chair)
- Sandra Kiefer (Oxford University)
- Aleks Kissinger (Oxford University)
- Bartek Klin (Oxford University)
- Antonin Kucera (Masaryk University Brno)
- Carsten Lutz (University of Leipzig)
- Jerzy Marcinkowski (University of Wrocław)
- Annabelle McIver (Macquaire University Sydney)
- Andrzej Murawski (Oxford University)
- Paweł Parys (University of Warsaw)
- Michał Pilipczuk (University of Warsaw)
- Joel Ouaknine (Max Planck Institute for Software Systems)
- Christian Riveros (Pontificia Universidad Catolica de Chile)
- Alexandra Silva (Cornell University)
- Balder ten Cate (ILLC Amsterdam)
- Szymon Toruńczyk (University of Warsaw)
- Igor Walukiewicz (CNRS, University of Bordeaux)
- Sarah Winter (IRIF, University Paris Cité)
- Georg Zetzsche (Max Planck Institute for Software Systems)
- Martin Ziegler (KAIST)
Registration
All prices are in euros and include 22% VAT. Note that every accepted paper requires at least one regular (non-student) registration.
The prices listed below are the early bird prices, valid until May 17.
Early bird | All inclusive | ICALP 2024 | LiCS 2024 | FSCD 2024 | Workshops (1 day) | Workshops (2 days) | Workshops (3 days) | Workshops (unlimited) |
---|---|---|---|---|---|---|---|---|
Regular non-member | 1000 | 800 | 640 | 640 | 80 | 160 | 240 | 320 |
Regular member | 950 | 750 | 590 | 590 | ||||
Student non-member | 780 | 600 | 480 | 480 | 60 | 120 | 180 | 240 |
Student member | 730 | 550 | 430 | 430 |
The prices listed below are the late registration prices, in place after May 17.
Late registration | All inclusive | ICALP 2024 | LiCS 2024 | FSCD 2024 | Workshops (1 day) | Workshops (2 days) | Workshops (3 days) | Workshops (unlimited) |
---|---|---|---|---|---|---|---|---|
Regular non-member | 1200 | 960 | 770 | 770 | 100 | 200 | 300 | 400 |
Regular member | 1150 | 910 | 720 | 720 | ||||
Student non-member | 780 | 720 | 580 | 580 | 80 | 160 | 240 | 320 |
Student member | 730 | 670 | 530 | 530 |
Membership discounts
The relevant membership disounts apply as follows: for ICALP an EATCS membership, for LiCS an ACM/ACM SigLog/IEEE membership, for FSCD an ACM/ACM SigLog/ACM SIGPLAN membership. Any of the above memberships qualifies for a discounted all-inclusive price.
Workshop participation
Conference participants who purchase a conference-specific registration (i.e. ICALP, LiCS or FSCD) and who also wish to attend workshops need to purchase an additional workshop registration, depending on how many days of workshops they wish to attend. The all-inclusive price includes access to all three conferences and unlimited workshop participation.
Welcome reception, Tuesday 9 July
All conference registrations include a ticket to the Welcome reception at Kadriorg Art Museum, Weizengergi 37, on the evening of Tuesday 9 July.
Joint banquet, Wednesday 10 July
The joint banquet will be held on Wednesday 10 July at the Tallinn Seaplane Harbour Museum. All participants who want to attend the banquet must purchase a banquet ticket separately -- the early bird price until May 17 is 85 euros per banquet ticket, the price after May 17 is 100 euros. Additional banquet tickets can be purchased for accompanying people. Note that the all-inclusive price does not include a banquet ticket.
To register, please click on the following link. Our partner Fienta takes payments and provides invoices. For questions regarding registration please email icalp_lics_fscd2024@taltech.ee.
Cancellations and refunds
Cancellations should be notified in writing by e-mail to ICALP_LiCS_FSCD2024@taltech.ee. Your cancellation will be confirmed in writing.
Cancellations are subject to the following conditions:
- Cancellations received by May 31, 2024: 10% is held as an administrative fee.
- Cancellations received after May 31, 2024: no refund will be made.
All refunds will be processed after the meeting.
Letter of Confirmation of Participation
A Letter of Confirmation of participation for VISA Applications or other purposes can be requested by e-mail to ICALP_LiCS_FSCD2024@taltech.ee. Letters of Confirmation will only be issued for fully registered presenters, e.g. an accepted article + full payment of the registration fees is required. Issuace of the visa will depend on a relevant official. In case the presenter will be denied the visa, a full refund will be made even after May 31. The organizers of the conference will not take any financial responsibilities of the potential costs of a delegate travelling to and during the stay in Estonia. Details on visa and consular issues, crossing the border, etc. are available at the MFA of Estonia.
Local Information
For questions regarding local organisation and local information, please email ICALP_LiCS_FSCD2024@taltech.ee.
Venue, Tallinn and Estonia
The conferences and workshops will be held in the Astra building on the campus of Tallinn University.
The address is Narva mnt 29. This is a central location, within walking distance of the old town, and is easily accessible from the airport. There will be some disruption of local transport in Tallinn in the summer due to planned road upgrades. You can plan your trip here.
Conference participants may take the opporunity to extend their stay and visit Estonia. Estonia is truly magical in early July – there's plenty of sun and the evenings are long and warm. The portal visit estonia is a great source of tourist information.
For useful advice and inspiration on Tallinn’s top attractions, activities, events, and places to eat and drink, check out the city’s official tourism portal, visittallinn.ee, or follow @VisitTallinn on social media
July 9 Welcome Reception
Venue: Kadriorg Art Museum (housed in the Kadriorg Palace)
Address: Weizenbergi 37
Walk from the Conference Venue : 1,1 km / 16 minutes
July 10 Joint Banquet
Venue: Seaplane Harbour Museum
Address: Vesilennuki 6
Distance from the Conference Venue ca 3 km. Transfers will be provided from the conference venue.
Accommodation
There are plenty of accommodation choices for all budgets in the area. We have an agreed discount rate for a limited number of rooms for conference participants at several local hotels:
Nordic Hotel Forum, (4* superior), Viru väljak 3, which is 15 minutes walk or a 3 minute tram ride from the conference location. Nordic Hotel Forum is a 4 star superior hotel in the prime location in Tallinn that has recently completed a full renovation to the entire hotel. The hotel offers spacious and elegant hotel rooms and a Leisure Centre on the 8th floor with magnificent views over the historic Old Town of Tallinn. The price includes buffet breakfast, free WiFi and use of hotel’s leisure centre on the top floor with fully equipped gym, indoor pool and saunas. Book here.
Kalev Spa Hotel and Water Park, (4*), Aia St 18, 20 minutes walk from the conference venue and accessible by Bus Line 8, stop Ahtri to Uus-Sadama. Located near the historic Old Town and the culturally vibrant seashore area. Perfect for both leisure and business travellers looking to rejuvenate body and soul with the ultimate spa experience. Modern amenities, including luxurious spa facilities, indoor pools, and comfortable accommodation. Book here.
Radisson Park Inn Central, (3*), Narva Rd 7c, 10 minutes walk from conference venue or easily accesssible via tram. Located a 5-minute walk away from the medieval old town. The price includes breakfast and free Wi-Fi. Well accessible from the Airport and Port of Tallinn. Book here.
Go Hotel Schnelli, (3*), Toompuiestee 37/1, 35 minutes walk to the conference venue or accessible in ~20 mins by public transport via Bus number 8, Stop Balti Jaam to Uus-Sadama. A budget-friendly hotel, located in the immediate vicinity of Tallinn's Old Town and the historic railway passenger terminal, Balti Jaam. Right next to the vibrant Kalamaja district and the Telliskivi area, known for its numerous popular restaurants and venues. A perfect location for evening hang-outs! Book here.
Hestia Hotel Barons, (4*), Suur-Karja 7, located in the Old Town, 25 minutes walk or a short tram ride to the conference venue. Book here.
Hestia Hotel Europa, (4*), Paadi St 5, 13 minute walk from the conference venue. Book here.
Hestia Hotel Seaport, (3*), Uus-Sadama St 23, 9 minute walk from the conference venue. Book here.
Getting there and local transport
Tallinn Airport offers direct flights to many European cities and is also well-connected to several regional hubs, with several daily flights to Helsiki, Warsaw, Stockholm and Frankfurt.
It is also possible to get to Tallinn by ferry from Helsiki (~2 hours, several daily connections), and by coach from Riga, Vilnius and other cities in the Baltic region.
While Tallinn has an excellent and affordable local transport network, please note that there are major road construction works going on in the Tallinn City centre, as a new tram line is being built. Check the routes/stops situation, how to get to your needed locations. There is relevant/current data available on the Tallinn website.
The conference is supported by the City of Tallinn. All the participants will get a free Tallinn public transportation pass. Relevant details will be sent in due course.
Some links you might find useful planning your trip:
Ministry of Foreign Affairs (visa and consular issues, crossing the border, …) https://vm.ee/en
Visit Estonia (the official travel guide to Estonia) https://www.visitestonia.com/en/
Visit Tallinn (plan your trip, getting to the centre, see&do, …) https://www.visittallinn.ee/eng/visitor
Tallinn Airport https://airport.ee/en/tallinn-airport/
Port of Tallinn https://www.ts.ee/en/departures/
Tallinn Coach Station https://www.bussijaam.ee/en/tickets/
Public transportation routes and timetables_Tallinn https://transport.tallinn.ee/#tallinna-linn/en
Reconstruction of the roads in Tallinn https://www.tallinn.ee/en/vanasadamatramm