*8th IGAFIT Highlight of Algorithms conference*
Charles University, Prague, Czechia
https://2023.highlightsofalgorithms.org/
The IGAFIT Highlights of Algorithms (HALG) conference is designed to be a
forum for presenting the highlights of recent developments in algorithms
and for discussing potential further advances in this area. The conference
will provide a broad picture of the latest research in algorithms through a
series of invited talks, as well as the possibility for all researchers and
students to present their recent results through a series of short talks
and poster presentations. Attending the IGAFIT Highlights of Algorithms
conference will also be an opportunity for networking and meeting leading
researchers in algorithms.
For local information, visa information, or information about registration,
please contact info@halg.mff.cuni.cz
PROGRAM
A detailed schedule is available at:
https://2023.highlightsofalgorithms.org/programme.html
REGISTRATION
https://2023.highlightsofalgorithms.org/registration/
*Early registration (by 21th May 2023)*Students: 2600 CZK
Non-students: 3500 CZK
*Late registration (from 22st May 2023)*
Students: 4000 CZK
Non-students: 5000 CZK
*On-site registration: *6000 CZK
Registration includes the lunches provided, coffee breaks, and the
conference reception.
INVITED SPEAKERS
Survey speakers:
Sepehr Assadi (Rutgers University)
Klaus Jansen (Kiel University)
Tillmann Miltzow (Utrecht University)
Merav Parter (Weizmann Institute of Science)
Marcin Pilipczuk (University of Warsaw)
Uri Stemmer (Tel Aviv University)
Invited talks:
Xavier Allamigeon (INRIA) — No Self-concordant Barrier Interior Point
Method is Strongly Polynomial
Michael Anastos (Carnegie Mellon University) — A Fast Algorithm on Average
for Solving the Hamilton Cycle Problem
Christian Coester (University of Oxford) — Shortest Paths without a Map,
but with an Entropic Regularizer
Ohad-Noy Feldheim (Hebrew University of Jerusalem) — The Power of Two
Choices in Graphical Allocation
Jie Gao (Rutgers University) — On Cyclic Solutions to the Min-Max Latency
Multi-Robot Patrolling Problem
Mohsen Ghaffari (Massachusetts Institute of Technology) — Local Computation
of Maximum Independent Set
Alexandros Hollender (École Polytechnique Fédérale de Lausanne) —
Pure-Circuit: Strong Inapproximability for PPAD
Linda Kleist (Technical University Braunschweig) — A Solution to Ringel's
Circle Problem
Ariel Kulik (CISPA Helmholtz Center for Information Security) — Faster
Exponential-Time Approximation Algorithms Using Approximate Monotone Local
Search
William Kuszmaul (Massachusetts Institute of Technology) — A Hash Table
Without Hash Functions, and How to Get the Most Out of Your Random Bits
Rasmus Kyng (ETH Zurich) — Maximum Flow and Minimum-Cost Flow in
Almost-Linear Time
Kent Quanrud (Purdue University) — Densest Subgraph: Supermodularity,
Iterative Peeling, and Flow
Balasubramanian Sivan (Google Research) — Approximately Efficient Bilateral
Trade
Ola Svensson (École Polytechnique Fédérale de Lausanne) — Flow Time
Scheduling and Prefix Beck-Fiala
Nicole Wein (Rutgers University) — Online List Labeling: Breaking the
log^2(n) Barrier
Andreas Wiese (Technical University Munich) — A PTAS for Unsplittable Flow
on a Path
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
