| Publication | Date of Publication | Type |
|---|
| Mapping tree-structured combinatorial optimization problems onto parallel computers | 2024-06-21 | Paper |
| Which is the worst-case Nash equilibrium? | 2024-06-08 | Paper |
| Bandwidth and profile minimization | 2024-02-28 | Paper |
| $$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players | 2023-06-30 | Paper |
| A better upper bound on the bisection width of de Bruijn networks | 2022-11-09 | Paper |
| (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions | 2022-10-04 | Paper |
| Communication throughput of interconnection networks | 2022-08-18 | Paper |
| Broadcasting in butterfly and debruijn networks | 2022-08-18 | Paper |
| The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values | 2021-03-09 | Paper |
| Conditional value-at-risk: structure and complexity of equilibria | 2020-01-22 | Paper |
| Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube | 2018-04-27 | Paper |
| Conditional value-at-risk: structure and complexity of equilibria | 2018-02-13 | Paper |
| The complexity of equilibria for risk-modeling valuations | 2016-05-18 | Paper |
| Weighted Boolean Formula Games | 2016-01-27 | Paper |
| Minimizing expectation plus variance | 2016-01-13 | Paper |
| The complexity of pure equilibria in mix-weighted congestion games on parallel links | 2015-09-15 | Paper |
| Routing (un-) splittable flow in games with player-specific affine latency functions | 2014-09-09 | Paper |
| How many attackers can selfish defenders catch? | 2014-04-10 | Paper |
| COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE | 2014-04-10 | Paper |
| Minimizing Expectation Plus Variance | 2013-03-13 | Paper |
| On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment | 2013-02-19 | Paper |
| Exact Price of Anarchy for Polynomial Congestion Games | 2012-02-11 | Paper |
| Computing Nash equilibria for scheduling on restricted parallel links | 2010-10-06 | Paper |
| Local search: simple, successful, but sometimes sluggish | 2010-09-07 | Paper |
| Computing Nash equilibria for scheduling on restricted parallel links | 2010-08-15 | Paper |
| On the Power of Nodes of Degree Four in the Local Max-Cut Problem | 2010-05-28 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395978 | 2009-09-15 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future | 2009-07-09 | Paper |
| Fair cost-sharing methods for scheduling jobs on parallel machines | 2009-06-24 | Paper |
| Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions | 2009-03-12 | Paper |
| Voronoi Games on Cycle Graphs | 2009-02-03 | Paper |
| Distributing Unit Size Workload Packages in Heterogeneous Networks | 2009-01-19 | Paper |
| Nash equilibria in discrete routing games with convex latency functions | 2008-11-19 | Paper |
| A new model for selfish routing | 2008-11-12 | Paper |
| The Power of Two Prices: Beyond Cross-Monotonicity | 2008-09-17 | Paper |
| Congestion Games with Player-Specific Constants | 2008-09-17 | Paper |
| Routing and Scheduling with Incomplete Information | 2008-09-02 | Paper |
| Exact Price of Anarchy for Polynomial Congestion Games | 2008-03-19 | Paper |
| Selfish routing with incomplete information | 2008-02-18 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Scheduling Unrelated Parallel Machines Computational Results | 2007-09-14 | Paper |
| A faster combinatorial approximation algorithm for scheduling unrelated parallel machines | 2007-07-16 | Paper |
| Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines | 2007-05-02 | Paper |
| The price of anarchy for polynomial social cost | 2007-01-09 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Upper bounds on the bisection width of 3- and 4-regular graphs | 2006-10-31 | Paper |
| A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks | 2006-09-14 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Edge-disjoint spanning trees for the generalized butterfly networks and their applications | 2005-12-07 | Paper |
| Structure and complexity of extreme Nash equilibria | 2005-10-26 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668737 | 2005-04-15 | Paper |
| Error analysis in minimax trees | 2004-10-27 | Paper |
| Sparse topologies with small spectrum size | 2004-10-27 | Paper |
| COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ | 2004-10-06 | Paper |
| On spectral bounds for the \(k\)-partitioning of graphs | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736840 | 2004-08-11 | Paper |
| New spectral lower bounds on the bisection width of graphs | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449200 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413789 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708598 | 2003-06-18 | Paper |
| Diffusion schemes for load balancing on heterogeneous networks | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779170 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766666 | 2002-07-22 | Paper |
| Compressing cube-connected cycles and butterfly networks | 2002-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762507 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550765 | 2002-01-01 | Paper |
| Quality matching and local improvement for multilevel graph-partitioning | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945781 | 2000-03-23 | Paper |
| Efficient schemes for nearest neighbor load balancing | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252039 | 1999-06-17 | Paper |
| Embedding ladders and caterpillars into the hypercube | 1999-02-14 | Paper |
| Efficient schemes for nearest neighbor load balancing | 1999-01-01 | Paper |
| Optimal embedding of complete binary trees into lines and grids | 1998-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718220 | 1997-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859012 | 1996-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870160 | 1996-04-09 | Paper |
| Broadcasting in butterfly and deBruijn networks | 1995-03-08 | Paper |
| Note on optimal gossiping in some weak-connected graphs | 1995-02-09 | Paper |
| Optimal algorithms for dissemination of information in generalized communication modes | 1994-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281526 | 1994-03-10 | Paper |
| Fast recognition of deterministic cfl's with a smaller number of processors | 1993-10-17 | Paper |
| Optimal algorithms for dissemination of information in some interconnection networks | 1993-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694714 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035242 | 1993-05-18 | Paper |
| On the parallel recognition of unambiguous context-free languages | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477932 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355240 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359735 | 1990-01-01 | Paper |
| Min Cut is NP-complete for edge weighted trees | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798266 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783557 | 1986-01-01 | Paper |
| The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725545 | 1986-01-01 | Paper |
| Ramsey numbers and an approximation algorithm for the vertex cover problem | 1985-01-01 | Paper |
| Solving satisfiability in less than \(2^ n\) steps | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740256 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716296 | 1985-01-01 | Paper |
| Bandwidth contrained NP-complete problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741051 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728033 | 1984-01-01 | Paper |
| Deterministic two-way one-head pushdown automata are very powerful | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341926 | 1983-01-01 | Paper |
| The complexity of determining a shortest cycle of even length | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322143 | 1983-01-01 | Paper |
| On eliminating nondeterminism from Turing machines which use less than logarithm worktape space | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341924 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341925 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902514 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929053 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4747916 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3939790 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3900989 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3926374 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885190 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3871927 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140382 | 1977-01-01 | Paper |
| Transformational methods and their application to complexity problems. Corrigenda | 1977-01-01 | Paper |
| On Optimal Control and Identification of Processes Governed by Parabolic Differential Equations of Second Order | 1977-01-01 | Paper |
| A recursive and a grammatical characterization of the exponential-time languages | 1977-01-01 | Paper |
| The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140413 | 1977-01-01 | Paper |
| Transformational methods and their application to complexity problems | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4151161 | 1976-01-01 | Paper |
| Relationships between pushdown automata with counters and complexity classes | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109295 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4773295 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778268 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4769965 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5685654 | 1973-01-01 | Paper |
| Über die Konvergenzordnung von Differenzenverfahren, die parabolische Anfangsrandwertaufgaben approximieren. (On the convergence ordre of difference methods approximating parabolic initial-boundary value problems) | 1970-01-01 | Paper |
