Directed Graph Exploration. - Klaus-Tycho Förster; Roger Wattenhofer (OPODIS, 2012)

Approximating Fault-Tolerant Domination in General Graphs. - Klaus-Tycho Förster (ANALCO, 2013)

SpareEye: enhancing the safety of inattentionally blind smartphone users. - Klaus-Tycho Förster; Alex Gross; Nino Hail; Jara Uitto; Roger Wattenhofer (MUM, 2014)

Deterministic Leader Election in Multi-hop Beeping Networks - (Extended Abstract). - Klaus-Tycho Förster; Jochen Seidel; Roger Wattenhofer (DISC, 2014)

Destroying networks for fun (and profit). - Nick Shelly; Brendan Tschaen; Klaus-Tycho Förster; Michael Alan Chang; Theophilus Benson; Laurent Vanbever (HotNets, 2015)

Programming in Scratch and Mathematics: Augmenting Your Geometry Curriculum, Today! - Klaus-Tycho Förster (SIGITE, 2015)

Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond. - Klaus-Tycho Förster; Rijad Nuridini; Jara Uitto; Roger Wattenhofer (SIROCCO, 2015)

The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration. - Klaus-Tycho Förster; Roger Wattenhofer (ICCCN, 2016)

Augmenting anycast network flows. - Sebastian Brandt 002; Klaus-Tycho Förster; Roger Wattenhofer (ICDCN, 2016)

Local checkability, no strings attached. - Klaus-Tycho Förster; Thomas Luedi; Jochen Seidel; Roger Wattenhofer (ICDCN, 2016)

On consistent migration of flows in SDNs. - Sebastian Brandt 002; Klaus-Tycho Förster; Roger Wattenhofer (INFOCOM, 2016)

RTDS: real-time discussion statistics. - Pascal Bissig; Jan Deriu; Klaus-Tycho Foerster; Roger Wattenhofer (MUM, 2016)

Reducing the latency-tail of short-lived flows: Adding forward error correction in data centers. - Klaus-Tycho Foerster; Demian Jaeger; David Stolz; Roger Wattenhofer (NCA, 2016)

Consistent updates in software defined networks: On dependencies, loop freedom, and blackholes. - Klaus-Tycho Förster; Ratul Mahajan; Roger Wattenhofer (Networking, 2016)

Integrating Programming into the Mathematics Curriculum: Combining Scratch and Geometry in Grades 6 and 7. - Klaus-Tycho Foerster (SIGITE, 2016)

A Concept for an Introduction to Parallelization in Java: Multithreading with Programmable Robots in Minecraft. - Klaus-Tycho Förster; Michael König 001; Roger Wattenhofer (SIGITE, 2016)

Survey of Consistent Network Updates. - Klaus-Tycho Foerster; Stefan Schmid 001; Stefano Vissicchio (CoRR, 2016)

Lower and upper competitive bounds for online directed graph exploration. - Klaus-Tycho Foerster; Roger Wattenhofer (Theor. Comput. Sci., 2016)

Don't disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks. - Klaus-Tycho Förster (2016)

A Walk in the Clouds: Routing Through VNFs on Bidirected Networks. - Klaus-Tycho Foerster; Mahmoud Parham; Stefan Schmid 001 (ALGOCLOUD, 2017)

Distributed discussion diarisation. - Pascal Bissig; Klaus-Tycho Foerster; Simon Tanner; Roger Wattenhofer (CCNC, 2017)

Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds. - Klaus-Tycho Foerster; Linus Groner; Torsten Hoefler; Michael König 001; Sascha Schmid; Roger Wattenhofer (CIAC, 2017)

Teaching spatial geometry in a virtual world: Using minecraft in mathematics in grade 5/6. - Klaus-Tycho Foerster (EDUCON, 2017)

Run, Walk, Crawl: Towards Dynamic Link Capacities. - Rachee Singh; Monia Ghobadi; Klaus-Tycho Foerster; Mark Filer; Phillipa Gill (HotNets, 2017)

Local Checkability in Dynamic Networks. - Klaus-Tycho Foerster; Oliver Richter; Jochen Seidel; Roger Wattenhofer (ICDCN, 2017)

On the consistent migration of unsplittable flows: Upper and lower complexity bounds. - Klaus-Tycho Foerster (NCA, 2017)

Vom Flaggenalphabet zur Vorratsdatenspeicherung: Schülerinnen und Schüler als Multiplikatoren technischer Aspekte der digitalen Welt. - Klaus-Tycho Förster (INFOS, 2017)

Understanding and Mitigating Packet Corruption in Data Center Networks. - Danyang Zhuo; Monia Ghobadi; Ratul Mahajan; Klaus-Tycho Förster; Arvind Krishnamurthy; Thomas E. Anderson (SIGCOMM, 2017)

Wireless Evacuation on m Rays with k Searchers. - Sebastian Brandt 002; Klaus-Tycho Foerster; Benjamin Richner; Roger Wattenhofer (SIROCCO, 2017)

Charting the Complexity Landscape of Waypoint Routing. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Riko Jacob; Stefan Schmid 001 (CoRR, 2017)

Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs. - Sebastian Brandt 002; Klaus-Tycho Foerster; Roger Wattenhofer (Pervasive Mob. Comput., 2017)

Characterizing the algorithmic complexity of reconfigurable data center architectures. - Klaus-Tycho Foerster; Manya Ghobadi; Stefan Schmid 001 (ANCS, 2018)

Beyond Binary Failures in Networks. - Rachee Singh; Manya Ghobadi; Klaus-Tycho Foerster; Mark Filer; Phillipa Gill (ANRW, 2018)

Teaching programming skills in primary school mathematics classes: An evaluation using game programming. - Emmy-Charlotte Förster; Klaus-Tycho Förster; Thomas Löwe (EDUCON, 2018)

Scheduling Congestion-Free Updates of Multiple Flows with Chronicle in Timed SDNs. - Jiaqi Zheng 001; Bo Li 061; Chen Tian 001; Klaus-Tycho Foerster; Stefan Schmid 001; Guihai Chen; Jie Wux (ICDCS, 2018)

TI-MFA: Keep calm and reroute segments fast. - Klaus-Tycho Foerster; Mahmoud Parham; Marco Chiesa; Stefan Schmid 001 (INFOCOM Workshops, 2018)

On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities. - Klaus-Tycho Foerster (NCA, 2018)

Waypoint Routing in Special Networks. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Riko Jacob; Mahmoud Parham; Stefan Schmid 001 (Networking, 2018)

Local Fast Segment Rerouting on Hypercubes. - Klaus-Tycho Foerster; Mahmoud Parham; Stefan Schmid 001; Tao Wen (OPODIS, 2018)

RADWAN: rate adaptive wide area network. - Rachee Singh; Manya Ghobadi; Klaus-Tycho Foerster; Mark Filer; Phillipa Gill (SIGCOMM, 2018)

Charting the Algorithmic Complexity of Waypoint Routing. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Riko Jacob; Stefan Schmid 001 (Comput. Commun. Rev., 2018)

Local Fast Failover Routing With Low Stretch. - Klaus-Tycho Foerster; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (Comput. Commun. Rev., 2018)

Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs. - Klaus-Tycho Foerster; Thomas Luedi; Jochen Seidel; Roger Wattenhofer (Theor. Comput. Sci., 2018)

Loop-Free Route Updates for Software-Defined Networks. - Klaus-Tycho Foerster; Arne Ludwig; Jan Marcinkowski; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2018)

Bonsai: Efficient Fast Failover Routing Using Small Arborescences. - Klaus-Tycho Foerster; Andrzej Kamisinski; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (DSN, 2019)

On the Power of Preprocessing in Decentralized Network Optimization. - Klaus-Tycho Foerster; Juho Hirvonen; Stefan Schmid 001; Jukka Suomela (INFOCOM, 2019)

CASA: Congestion and Stretch Aware Static Fast Rerouting. - Klaus-Tycho Foerster; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (INFOCOM, 2019)

DaRTree: deadline-aware multicast transfers in reconfigurable wide-area networks. - Long Luo; Klaus-Tycho Foerster; Stefan Schmid 001; Hongfang Yu (IWQoS, 2019)

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees. - Klaus-Tycho Foerster; Stefan Schmid 001 (NCA, 2019)

Latency and Consistent Flow Migration: Relax for Lossless Updates. - Klaus-Tycho Foerster; Laurent Vanbever; Roger Wattenhofer (Networking, 2019)

Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates. - Klaus-Tycho Foerster (PODC, 2019)

Does Preprocessing Help under Congestion? - Klaus-Tycho Foerster; Janne H. Korhonen; Joel Rybicki; Stefan Schmid 001 (PODC, 2019)

On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures. - Klaus-Tycho Foerster; Maciej Pacut; Stefan Schmid 001 (Comput. Commun. Rev., 2019)

Survey of Consistent Software-Defined Network Updates. - Klaus-Tycho Foerster; Stefan Schmid 001; Stefano Vissicchio (IEEE Commun. Surv. Tutorials, 2019)

Brief Announcement: Does Preprocessing Help under Congestion? - Klaus-Tycho Foerster; Janne H. Korhonen; Joel Rybicki; Stefan Schmid 001 (CoRR, 2019)

Congestion-Free Rerouting of Multiple Flows in Timed SDNs. - Jiaqi Zheng 001; Bo Li 061; Chen Tian 001; Klaus-Tycho Foerster; Stefan Schmid 001; Guihai Chen; Jie Wu 001; Rui Li 020 (IEEE J. Sel. Areas Commun., 2019)

Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity. - Klaus-Tycho Foerster; Stefan Schmid 001 (SIGACT News, 2019)

Conic Formation in Presence of Faulty Robots. - Debasish Pattanayak; Klaus-Tycho Foerster; Partha Sarathi Mandal 001; Stefan Schmid 001 (ALGOSENSORS, 2020)

Toward Active and Passive Confidentiality Attacks on Cryptocurrency Off-chain Networks. - Utz Nisslmueller; Klaus-Tycho Foerster; Stefan Schmid 001; Christian Decker 002 (ICISSP, 2020)

Inferring Sensitive Information in Cryptocurrency Off-Chain Networks Using Probing and Timing Attacks. - Utz Nisslmueller; Klaus-Tycho Foerster; Stefan Schmid 001; Christian Decker 002 (ICISSP (Revised Selected Papers), 2020)

SplitCast: Optimizing Multicast Flows in Reconfigurable Datacenter Networks. - Long Luo; Klaus-Tycho Foerster; Stefan Schmid 001; Hongfang Yu (INFOCOM, 2020)

Maximally Resilient Replacement Paths for a Family of Product Graphs. - Mahmoud Parham; Klaus-Tycho Foerster; Petar Kosic; Stefan Schmid 001 (OPODIS, 2020)

OptFlow: A Flow-based Abstraction for Programmable Topologies. - Klaus-Tycho Foerster; Long Luo; Manya Ghobadi (SOSR, 2020)

Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally. - Klaus-Tycho Foerster; Juho Hirvonen; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (DISC, 2020)

Walking Through Waypoints. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Stefan Schmid 001 (Algorithmica, 2020)

Efficient non-segregated routing for reconfigurable demand-aware networks. - Thomas Fenz; Klaus-Tycho Foerster; Stefan Schmid 001; Anaïs Villedieu (Comput. Commun., 2020)

Distributed Pattern Formation With Faulty Robots. - Debasish Pattanayak; Klaus-Tycho Foerster; Partha Sarathi Mandal 001; Stefan Schmid 001 (CoRR, 2020)

Input-dynamic distributed graph algorithms for congested networks. - Klaus-Tycho Foerster; Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001 (CoRR, 2020)

Deadline-Aware Multicast Transfers in Software-Defined Optical Wide-Area Networks. - Long Luo; Klaus-Tycho Foerster; Stefan Schmid 001; Hongfang Yu (IEEE J. Sel. Areas Commun., 2020)

Inter-Datacenter Bulk Transfers: Trends and Challenges. - Long Luo; Hongfang Yu; Klaus-Tycho Foerster; Max Noormohammadpour; Stefan Schmid 001 (IEEE Netw., 2020)

Load-Optimization in Reconfigurable Networks: Algorithms and Complexity of Flow Routing. - Wenkai Dai; Klaus-Tycho Foerster; David Fuchssteiner; Stefan Schmid 001 (SIGMETRICS Perform. Evaluation Rev., 2020)

Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs. - Sebastian Brandt 002; Klaus-Tycho Foerster; Jonathan Maurer; Roger Wattenhofer (Theor. Comput. Sci., 2020)

Wireless evacuation on m rays with k searchers. - Sebastian Brandt 002; Klaus-Tycho Foerster; Benjamin Richner; Roger Wattenhofer (Theor. Comput. Sci., 2020)

AirNet: Energy-Aware Deployment and Scheduling of Aerial Networks. - Elif Bozkaya; Klaus-Tycho Foerster; Stefan Schmid 001; Berk Canberk (IEEE Trans. Veh. Technol., 2020)

On Efficient Oblivious Wavelength Assignments for Programmable Wide-Area Topologies. - Thomas Fenz; Klaus-Tycho Foerster; Stefan Schmid 001 (ANCS, 2021)

Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths). - Oliver Schweiger; Klaus-Tycho Foerster; Stefan Schmid 001 (ANCS, 2021)

Shortcutting Fast Failover Routes in the Data Plane. - Apoorv Shukla; Klaus-Tycho Foerster (ANCS, 2021)

On the Feasibility of Perfect Resilience with Local Fast Failover. - Klaus-Tycho Foerster; Juho Hirvonen; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (APOCS, 2021)

Traffic engineering with joint link weight and segment optimization. - Mahmoud Parham; Thomas Fenz; Nikolaus Süss; Klaus-Tycho Foerster; Stefan Schmid 001 (CoNEXT, 2021)

P4Update: fast and locally verifiable consistent network updates in the P4 data plane. - Zikai Zhou; Mu He; Wolfgang Kellerer; Andreas Blenk; Klaus-Tycho Foerster (CoNEXT, 2021)

On Comparing and Enhancing Two Common Approaches to Network Community Detection. - Niko Motschnig; Alexander Ramharter; Oliver Schweiger; Philipp Zabka; Klaus-Tycho Foerster (GLOBECOM, 2021)

Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network. - Philipp Zabka; Klaus-Tycho Förster; Stefan Schmid 001; Christian Decker 002 (ICDCN, 2021)

Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes. - Klaus-Tycho Foerster; Andrzej Kamisinski; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (INFOCOM, 2021)

Demand-Aware Plane Spanners of Bounded Degree. - Esra Ceylan; Klaus-Tycho Foerster; Stefan Schmid 001; Katsiaryna Zaitsava (Networking, 2021)

Are WANs Ready for Optical Topology Programming? - Matthew Nance Hall; Paul Barford; Klaus-Tycho Foerster; Manya Ghobadi; William Jensen; Ramakrishnan Durairajan (OptSys@SIGCOMM, 2021)

On Comparing and Enhancing Common Approaches to Network Community Detection. - Niko Motschnig; Alexander Ramharter; Oliver Schweiger; Philipp Zabka; Klaus-Tycho Foerster (CoRR, 2021)

A Survey of Reconfigurable Optical Networks. - Matthew Nance Hall; Klaus-Tycho Foerster; Stefan Schmid 001; Ramakrishnan Durairajan (Opt. Switch. Netw., 2021)

Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion. - Maciej Pacut; Wenkai Dai; Alexandre Labbe; Klaus-Tycho Foerster; Stefan Schmid 001 (Perform. Evaluation, 2021)

Input-Dynamic Distributed Algorithms for Communication Networks. - Klaus-Tycho Foerster; Janne H. Korhonen; Ami Paz; Joel Rybicki; Stefan Schmid 001 (Proc. ACM Meas. Anal. Comput. Syst., 2021)

On the Price of Locality in Static Fast Rerouting. - Klaus-Tycho Foerster; Juho Hirvonen; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (DSN, 2022)

Short Paper: A Centrality Analysis of the Lightning Network. - Philipp Zabka; Klaus-Tycho Förster; Christian Decker 002; Stefan Schmid 001 (Financial Cryptography, 2022)

Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks. - Neta Rozen Schiff; Klaus-Tycho Foerster; Stefan Schmid 001; David Hay (OPODIS, 2022)

Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies. - Wenkai Dai; Michael Dinitz; Klaus-Tycho Foerster; Stefan Schmid 001 (DISC, 2022)

A Centrality Analysis of the Lightning Network. - Philipp Zabka; Klaus-Tycho Foerster; Stefan Schmid 001; Christian Decker 002 (CoRR, 2022)

Optimizing multicast flows in high-bandwidth reconfigurable datacenter networks. - Long Luo; Klaus-Tycho Foerster; Stefan Schmid 001; Hongfang Yu (J. Netw. Comput. Appl., 2022)

Empirical evaluation of nodes and channels of the lightning network. - Philipp Zabka; Klaus-Tycho Foerster; Stefan Schmid 001; Christian Decker 002 (Pervasive Mob. Comput., 2022)

Improved Fast Rerouting Using Postprocessing. - Klaus-Tycho Foerster; Andrzej Kamisinski; Yvonne-Anne Pignolet; Stefan Schmid 001; Gilles Trédan (IEEE Trans. Dependable Secur. Comput., 2022)

Towards Local Shortcutting of Fast Failover Routes. - Stephanie Althoff; Frederik Maassen; Marvin Weiler; Apoorv Shukla; Klaus-Tycho Foerster (StudentWorkshop@CoNEXT, 2023)

Live Demonstration of ML-based PON Characterization and Monitoring. - Maximilian Brügge; Jasper Müller; Sai Kireet Patri; Sander Jansen; Jim Zou; Stephanie Althoff; Klaus-Tycho Förster (OFC, 2023)

A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible. - Wenkai Dai; Klaus-Tycho Foerster; Stefan Schmid 001 (SPAA, 2023)

Transparent Fault Tolerance for Stateful Applications in Kubernetes with Checkpoint/Restore. - Henri Schmidt; Zeineb Rejiba; Raphael Eidenbenz; Klaus-Tycho Förster (SRDS, 2023)

Analyzing the Communication Clusters in Datacenters✱. - Klaus-Tycho Foerster; Thibault Marette; Stefan Neumann 003; Claudia Plant; Ylli Sadikaj; Stefan Schmid 001; Yllka Velaj (WWW, 2023)

Guest editorial: Structural Information and Communication Complexity 2021. - Klaus-Tycho Foerster; Tomasz Jurdzinski; Stefan Schmid 001 (Theor. Comput. Sci., 2023)

Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing. - Wenkai Dai; Klaus-Tycho Foerster; David Fuchssteiner; Stefan Schmid 001 (ACM Trans. Model. Perform. Evaluation Comput. Syst., 2023)

Short Paper: Towards 2-Resilient Local Failover in Destination-Based Routing. - Erik van den Akker 002; Klaus-Tycho Foerster (ALGOCLOUD, 2024)

Blockchain-Based Implementation of Service Function Chains in Multicloud and Multitenant Environments Over Containerized Networks. - Rui Kang; Mengfei Zhu; Klaus-Tycho Foerster (BRAINS, 2024)

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. - Wenkai Dai; Michael Dinitz; Klaus-Tycho Foerster; Long Luo; Stefan Schmid 001 (INFOCOM, 2024)

Local Fast Failover Routing on Directed Networks. - Jonas Grobe; Stephanie Althoff; Klaus-Tycho Foerster (RNDM, 2024)

Analyzing Network Routing Resilience: A Hybrid Approach of Face and Tree Routing. - Georgios Karamoussanlis; Stephanie Althoff; Erik van den Akker 002; Klaus-Tycho Foerster (RNDM, 2024)

Fault-Tolerant Local Recovery with Preprocessing in Multiple Shared Protection. - Mengfei Zhu; Rui Kang; Klaus-Tycho Foerster (RNDM, 2024)

Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs. - Erik van den Akker 002; Kevin Buchin; Klaus-Tycho Foerster (SIROCCO, 2024)

Brief Announcement: On the Feasibility of Local Failover Routing on Directed Graphs. - Erik van den Akker 002; Klaus-Tycho Foerster (SSS, 2024)

On the Resilience of Fast Failover Routing Against Dynamic Link Failures. - Wenkai Dai; Klaus-Tycho Foerster; Stefan Schmid 001 (CoRR, 2024)

Improving Scalability in Traffic Engineering via Optical Topology Programming. - Matthew Nance Hall; Paul Barford; Klaus-Tycho Foerster; Ramakrishnan Durairajan (IEEE Trans. Netw. Serv. Manag., 2024)