FRICO 2021


06.09 – 10.09.2021


Read more below


FRICO 2022 will take place in Bonn.

Despite Corona, FRICO 2021 achieved its mission to once again connect Ph.D. students from the field of combinatorial optimization. We had many great industry and scientific talks. Federica Cechetto’s talk from ETH Zurick on “Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stonger Approaches” stood out and has been awarded the best talk award. Niklas Troost from the University of Osnabrück and Corinna Mathwieser achieved a close second and third place. We hope to see all of you in Bonn, where Meike Neuwohner and Daniel Blankenburg will organize the FRICO 2022.



We are looking forward to meeting you and hosting the FRICO 2021. FRICO 2021 will take place virtually or at the Technical University of Munich (TUM), depending on the circumstances, from the 6th of September until the 10th of September. This workshop aims to connect doctoral students from the following areas of research:

  • Discrete Mathematics and Combinatorics
  • Linear and Non-Linear Optimization
  • Algorithms on Graphs
  • Randomized Algorithms
  • Approximation Algorithms
  • Online Optimization
  • Applications of Combinatorial Optimization

The format of the FRICO sets it apart from other workshops and conferences. Unique is that we explicitly support the presentation of work-in-progress, including open problems and partial proof ideas next to mathematical results.

We are aware that community building is an essential element of the FRICO, and it has become even more important during the current times. Therefore, even a virtual workshop will include a conference dinner, a bar night, and several additional opportunities to chat and discuss mathematical and non-mathematical problems during a pub quiz or an escape game in the evenings of the workshop.

This is made possible by our sponsors Siemens, TNG Technology Consulting, and DB Schenker. Additionally, this event is supported and co-organized by TopMath. Due to their joint support, there is no participation fee. Moreover, our sponsors will provide a unique perspective on how they apply optimization in practice at the “Industry Day.”

We are highly looking forward to your participation and the exciting research area that you will present. We are confident that you will benefit from the FRICO as much as we did from the last FRICO in Kaiserlautern.


You can simply register by sending an email to Please state your name, university/chair/institution/company, and your talk abstract and title(.txt/.pdf document, max 1500 characters). The talk will be held in English and be 30 minutes in length, including questions. You are welcome to ask any questions by sending an email to

The registration deadline is the 15th of July.

When registering, you agree to the processing of your data as described here.

Apply now



We will send you a full program after the registration deadline has passed. Stay tuned.


Ulrich Pferschy described the origin of the FRICO in the program booklet of the 10th FRICO. We translated his words into English.

“… However, some people who are taking part in this relaxed exchange of ideas for the first time may ask themselves how such an unstructured event came about. To prevent the formation of false legends, which are sometimes already spread in an hour with wine, I would like to briefly present the official version of the FRICO creation.

In the autumn of 1996, a two-week summer school on the approximation of combinatorial optimization problems took place in Udine (this was the summer school to which the great Papadimitriou had mistakenly arrived a year too early). On the free weekend contained therein, it was obvious to undertake an excursion into the surrounding wine country. At least this was the firm conviction of the two Graz participants, Rüdiger Rudolf and myself. Since excursions of this kind are only half as nice for two (if they are men), we successfully tried to win the apparently like-minded participants Dagmar Handke (Konstanz) and Katja Wolf (Cologne) as companions. The beautiful excursion ended in a trattoria in Cividale with a special local dish, which can best be described as a mixture of potatoes, onions, bacon, and cheese; nothing for a weak stomach. The Frico cheese, a Friulian specialty, gives the dish its name. In a cheerful circle, Katja invited all of us to a Frico dinner in Cologne without knowing what she was starting.

However, it was to take over a year before this invitation could be made more concrete. Now the way from Graz to Cologne is quite long, and as optimizers, we tried to combine the pleasant with the useful. Without further ado, we offered to combine the private visit with a lecture at the then ZPR Cologne. And so that it didn’t look as if the people of Cologne can only listen and have nothing to say themselves, Katja immediately obliged a few “locals” to give further lectures. Thus a one-day workshop had developed in the twinkling of an eye. Although the organizer said: “We can’t call it FRICO” I managed to find the acronym that is known today.

The first FRICO Workshop in 1997 was a great success (in contrast to the Frico dinner in the evening, which was canceled from the program in the following years). This moved Professor Schrader to donate a barrel of Kölsch and to ”threaten” to continue organizing this event format on his own if we did not. Of course, we couldn’t afford to let that happen, and so the second FRICO was decided in Graz in 1998.

The rest is history.”


  • 2019 TU Kaiserslautern

    Oliver Bachtler – “Decomposing a Cubic Graph”

  • 2018 Chemnitz

    Stephan Beyer – “A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs”

  • 2017 Trier

    Tobias Hofmann – “A Variant of the Periodic Event Scheduling Problem and its Computational Complexity”

  • 2016 Osnabrück

    Annette Ficker – “Balanced Optimization with Vector Costs”

  • 2015 Köln

    Ivo Hedtke – “SAT Formulations for the Minimum Genus Problem”

  • 2014 Magdeburg

    Marlis Bärthel – “On the Expected Transfer of (Taxed) Matrix Games”

  • 2013 Aachen

    Stefan Weltge – “Lower bounds on Sizes of IP-formulations”

  • 2012 Berlin

    Anja Fischer – “Polyhedral combinatorics for the asymmetric quadratic traveling salesman problem”

  • 2011 Groningen


  • 2010 Graz

    Julia Sponsel – “Projektion einer Matrix auf den kopositiven Kegel”

  • 2009 Köln

    Vera Weil – “Die Reed’sche Vermutung in dreiecksfreien Graphen”

  • 2008 Heidelberg

    Madeleine Theile – “Ein verallgemeinertes Shannon Switching Game”

  • 2007 Bayreuth

    Stefan Bundfuss – “Lösen von diskreten Optimierungsproblemen mittels copositiver Programme”

  • 2006 Chemnitz

    Mariano Zelke – “k-Zusammenhang im Semi-Streaming Modell”

  • 2005 Wien

    Bernhard Fuchs – “Approximation von Radienproblemen”

  • 2004 Cottbus

    Katja Korherr – “Die Rangbedingung”

  • 2003 Klagenfurt

    Elisabeth Gassner – “Algorithmus zur Lösung des parametrischen Zuordnungsproblems mit einer Anwendung auf das charakteristische Max-Polynom”

  • 2002 Köln

    Gereon Frahling – “Ein kombinatorischer Algorithmus zur Bestimmung von stabilen Mengen maximalen Gewichtes in bipartiten Graphen: Die Organisation eines Urlaubs ohne Beziehungsprobleme”

  • 2001 Berlin

    Britta Wienand – “Lineare und nichtlineare Maximum-Durchschnittsgewicht-Probleme auf Halbordnungen”

  • 2000 Aachen

    Thomas Epping – “Ein ‘paint shop’-Problem für Wörter”

  • 1999 Konstanz


  • 1998 Graz


  • 1997 Köln