default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Liebchen
2020 – today
- 2023
[j16]Berenike Masing
, Niels Lindner, Christian Liebchen:
Periodic timetabling with integrated track choice for railway construction sites. J. Rail Transp. Plan. Manag. 28: 100416 (2023)- [c19]Berenike Masing, Niels Lindner, Christian Liebchen:
Integrating Line Planning for Construction Sites into Periodic Timetabling via Track Choice. ATMOS 2023: 5:1-5:15 - 2022
- [j15]Niels Lindner, Christian Liebchen:
Timetable merging for the Periodic Event Scheduling Problem. EURO J. Transp. Logist. 11: 100081 (2022) - [j14]Christian Liebchen, Steffen Dutsch, Shiguang Jin, Norio Tomii, Yihui Wang:
The Ring Never Relieves - Response rules for metro circle lines. J. Rail Transp. Plan. Manag. 23: 100331 (2022) - [c18]Christian Liebchen:
Bidirectional Green Waves for Major Road Axes by Adjusting Separate Left-Turn Phases. OR 2022: 495-502 - 2021
- [c17]Niels Lindner, Christian Liebchen, Berenike Masing:
Forward Cycle Bases and Periodic Timetabling. ATMOS 2021: 2:1-2:14 - 2020
- [c16]Niels Lindner, Christian Liebchen:
Determining All Integer Vertices of the PESP Polytope by Flipping Arcs. ATMOS 2020: 5:1-5:18
2010 – 2019
- 2019
- [j13]Christian Liebchen, Hanno Schülldorf:
A collection of aspects why optimization projects for railway companies could risk not to succeed - A multi-perspective approach. J. Rail Transp. Plan. Manag. 11 (2019) - [c15]Niels Lindner, Christian Liebchen:
New Perspectives on PESP: T-Partitions and Separators. ATMOS 2019: 2:1-2:18 - 2018
- [c14]Ralf Borndörfer, Marika Karbstein, Christian Liebchen, Niels Lindner:
A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable. ATMOS 2018: 16:1-16:15 - 2017
- [j12]Gabrio Caimi, Leo G. Kroon, Christian Liebchen:
Models for railway timetable optimization: Applicability and applications in practice. J. Rail Transp. Plan. Manag. 6(4): 285-312 (2017) - [c13]Marc Goerigk, Christian Liebchen:
An Improved Algorithm for the Periodic Timetabling Problem. ATMOS 2017: 12:1-12:14 - [c12]Christian Liebchen:
On the Benefit of Preprocessing and Heuristics for Periodic Timetabling. OR 2017: 709-714 - 2011
- [j11]Ravindra K. Ahuja, Christian Liebchen:
Special issue of Networks on optimization in scheduled transportation networks. Networks 57(1): 1-2 (2011) - 2010
- [j10]Christian Liebchen, Michael Schachtebeck, Anita Schöbel, Sebastian Stiller, André Prigge:
Computing delay resistant railway timetables. Comput. Oper. Res. 37(5): 857-868 (2010)
2000 – 2009
- 2009
- [j9]Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig:
Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4): 199-243 (2009) - [j8]Christian Liebchen, Leon Peeters:
Integral cycle bases for cyclic timetabling. Discret. Optim. 6(1): 98-109 (2009) - [j7]Ekkehard Köhler, Christian Liebchen, Gregor Wünsch, Romeo Rizzi:
Lower bounds for strictly fundamental cycle bases in grid graphs. Networks 53(2): 191-205 (2009) - [j6]Christian Liebchen, Sebastian Stiller:
Delay resistant timetabling. Public Transp. 1(1): 55-72 (2009) - [p1]Christian Liebchen, Marco E. Lübbecke, Rolf H. Möhring, Sebastian Stiller:
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. Robust and Online Large-Scale Optimization 2009: 1-27 - 2008
- [j5]Christian Liebchen, Gregor Wünsch:
The zoo of tree spanner problems. Discret. Appl. Math. 156(5): 569-587 (2008) - [j4]Christian Liebchen:
The First Optimized Railway Timetable in Practice. Transp. Sci. 42(4): 420-435 (2008) - [c11]Christian Liebchen, Elmar Swarat:
The Second Chvatal Closure Can Yield Better Railway Timetables. ATMOS 2008 - 2007
- [j3]Christian Liebchen, Romeo Rizzi:
Classes of cycle bases. Discret. Appl. Math. 155(3): 337-355 (2007) - [j2]Michael Elkin, Christian Liebchen, Romeo Rizzi:
New length bounds for cycle bases. Inf. Process. Lett. 104(5): 186-193 (2007) - [c10]Ravindra K. Ahuja, Christian Liebchen, Juan A. Mesa:
ATMOS 2007 Abstracts Collection - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2007 - [c9]Ravindra K. Ahuja, Christian Liebchen, Juan A. Mesa:
ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2007 - [c8]Ralf Borndörfer, Christian Liebchen:
When Periodic Timetables Are Suboptimal. OR 2007: 449-454 - [c7]Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi:
Benchmarks for Strictly Fundamental Cycle Bases. WEA 2007: 365-378 - [e1]Christian Liebchen, Ravindra K. Ahuja, Juan A. Mesa:
ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, November 15-16, 2007, Sevilla, Spain. OASIcs 7, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2006
- [c6]Christian Liebchen:
Periodic Timetable Optimization in Public Transport. OR 2006: 29-36 - 2005
- [j1]Christian Liebchen, Romeo Rizzi:
A greedy approach to compute a minimum cycle basis of a directed graph. Inf. Process. Lett. 94(3): 107-112 (2005) - [c5]Christian Liebchen:
A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables. WEA 2005: 354-366 - 2004
- [c4]Christian Liebchen, Rolf H. Möhring:
The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond. ATMOS 2004: 3-40 - 2003
- [c3]Christian Liebchen:
Finding Short Integral Cycle Bases for Cyclic Timetabling. ESA 2003: 715-726 - [c2]Christian Liebchen:
Symmetry for Periodic Railway Timetables. ATMOS 2003: 34-51 - 2002
- [c1]Christian Liebchen, Rolf H. Möhring:
A Case Study in Periodic Timetabling. ATMOS 2002: 18-31
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.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 19:24 CEST 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:
