| Publication | Date of Publication | Type |
|---|
| On the parallel complexity of the alternating Hamiltonian cycle problem | 2024-07-05 | Paper |
| Task assignment in distributed systems using network flow methods | 2024-07-05 | Paper |
| NC algorithms for antidirected hamiltonian paths and cycles in tournaments | 2024-01-05 | Paper |
| Scheduling MapReduce jobs on identical and unrelated processors | 2020-07-02 | Paper |
| Scheduling MapReduce jobs under multi-round precedences | 2018-01-11 | Paper |
| Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem | 2017-12-06 | Paper |
| Bin Packing with Colocations | 2017-04-04 | Paper |
| Speed scaling for maximum lateness | 2016-03-09 | Paper |
| Energy-Efficient Algorithms for Non-preemptive Speed-Scaling | 2015-11-20 | Paper |
| On multiprocessor temperature-aware scheduling problems | 2014-08-18 | Paper |
| Bounded max-colorings of graphs | 2014-04-28 | Paper |
| Approximating the Throughput by Coolest First Scheduling | 2013-09-13 | Paper |
| Exact and Approximation Algorithms for Densest k-Subgraph | 2013-04-12 | Paper |
| Improved approximation algorithms for the max edge-coloring problem | 2013-04-04 | Paper |
| Speed Scaling for Maximum Lateness | 2012-09-25 | Paper |
| On Multiprocessor Temperature-Aware Scheduling Problems | 2012-07-16 | Paper |
| The \textsc{max quasi-independent set} problem | 2012-07-10 | Paper |
| Improved Approximation Algorithms for the Max-Edge Coloring Problem | 2011-05-12 | Paper |
| On the max-weight edge coloring problem | 2010-12-21 | Paper |
| Bounded Max-colorings of Graphs | 2010-12-09 | Paper |
| Approximating the max-edge-coloring problem | 2010-08-11 | Paper |
| The max quasi-independent set Problem | 2010-06-22 | Paper |
| A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs | 2010-04-19 | Paper |
| Approximating the Max Edge-Coloring Problem | 2009-12-11 | Paper |
| On the Maximum Edge Coloring Problem | 2009-02-12 | Paper |
| The densest \(k\)-subgraph problem on clique graphs | 2008-04-23 | Paper |
| Selfish Routing and Path Coloring in All-Optical Networks | 2008-04-15 | Paper |
| Approximating a Class of Classification Problems | 2008-03-14 | Paper |
| Scheduling trees with large communication delays on two identical processors | 2007-12-20 | Paper |
| Designing PTASs for MIN-SUM scheduling problems | 2006-04-28 | Paper |
| Scheduling in switching networks with set-up delays | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813025 | 2004-08-12 | Paper |
| A PTAS for the average weighted completion time problem on unrelated machines. | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782739 | 2002-12-02 | Paper |
| Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases | 2001-04-26 | Paper |
| On the parallel complexity of the alternating Hamiltonian cycle problem | 2000-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945672 | 2000-03-23 | Paper |
| A sufficient condition for maximum cycles in bipartite digraphs | 2000-03-02 | Paper |
| Scheduling UET-UCT series-parallel graphs on two processors | 1997-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892336 | 1997-01-28 | Paper |
