| 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?
SIAM Journal on Discrete Mathematics | 2024-06-08 | Paper |
Bandwidth and profile minimization
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
$$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
A better upper bound on the bisection width of de Bruijn networks (extended abstract)
Lecture Notes in Computer Science | 2022-11-09 | Paper |
(In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions
Theory of Computing Systems | 2022-10-04 | Paper |
Broadcasting in butterfly and deBruijn networks (extended abstract)
STACS 92 | 2022-08-18 | Paper |
Communication throughput of interconnection networks
Mathematical Foundations of Computer Science 1994 | 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
Theoretical Computer Science | 2021-03-09 | Paper |
Conditional value-at-risk: structure and complexity of equilibria
Theoretical Computer Science | 2020-01-22 | Paper |
Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube
Journal of Graph Theory | 2018-04-27 | Paper |
Conditional value-at-risk: structure and complexity of equilibria
Algorithmic Game Theory | 2018-02-13 | Paper |
The complexity of equilibria for risk-modeling valuations
Theoretical Computer Science | 2016-05-18 | Paper |
Weighted Boolean formula games
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Minimizing expectation plus variance
Theory of Computing Systems | 2016-01-13 | Paper |
The complexity of pure equilibria in mix-weighted congestion games on parallel links
Information Processing Letters | 2015-09-15 | Paper |
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Computing Nash equilibria for two-player restricted network congestion games is \(\mathcal{PLS}\)-complete
Parallel Processing Letters | 2014-04-10 | Paper |
How many attackers can selfish defenders catch?
Discrete Applied Mathematics | 2014-04-10 | Paper |
Minimizing expectation plus variance
Algorithmic Game Theory | 2013-03-13 | Paper |
On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment
Theoretical Computer Science | 2013-02-19 | Paper |
Exact price of anarchy for polynomial congestion games
SIAM Journal on Computing | 2012-02-11 | Paper |
Computing Nash equilibria for scheduling on restricted parallel links
Theory of Computing Systems | 2010-10-06 | Paper |
Local search: simple, successful, but sometimes sluggish
Automata, Languages and Programming | 2010-09-07 | Paper |
Computing Nash equilibria for scheduling on restricted parallel links
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
On the Power of Nodes of Degree Four in the Local Max-Cut Problem
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2010-02-23 | Paper |
| scientific article; zbMATH DE number 5604095 (Why is no real title available?) | 2009-09-15 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Fair cost-sharing methods for scheduling jobs on parallel machines
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
Automata, Languages and Programming | 2009-03-12 | Paper |
Voronoi Games on Cycle Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Distributing Unit Size Workload Packages in Heterogeneous Networks
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Distributing Unit Size Workload Packages in Heterogeneous Networks
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences | 2008-11-19 | Paper |
A new model for selfish routing
Theoretical Computer Science | 2008-11-12 | Paper |
Congestion Games with Player-Specific Constants
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
The Power of Two Prices: Beyond Cross-Monotonicity
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Routing and Scheduling with Incomplete Information
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Exact Price of Anarchy for Polynomial Congestion Games
STACS 2006 | 2008-03-19 | Paper |
Selfish routing with incomplete information
Theory of Computing Systems | 2008-02-18 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Scheduling Unrelated Parallel Machines Computational Results
Experimental Algorithms | 2007-09-14 | Paper |
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Theoretical Computer Science | 2007-07-16 | Paper |
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
Lecture Notes in Computer Science | 2007-05-02 | Paper |
The price of anarchy for polynomial social cost
Theoretical Computer Science | 2007-01-09 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Upper bounds on the bisection width of 3- and 4-regular graphs
Journal of Discrete Algorithms | 2006-10-31 | Paper |
A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
Theoretical Computer Science | 2006-09-14 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Edge-disjoint spanning trees for the generalized butterfly networks and their applications
Journal of Parallel and Distributed Computing | 2005-12-07 | Paper |
Structure and complexity of extreme Nash equilibria
Theoretical Computer Science | 2005-10-26 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2156279 (Why is no real title available?) | 2005-04-15 | Paper |
Error analysis in minimax trees
Theoretical Computer Science | 2004-10-27 | Paper |
Sparse topologies with small spectrum size
Theoretical Computer Science | 2004-10-27 | Paper |
COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗
Parallel Algorithms and Applications | 2004-10-06 | Paper |
On spectral bounds for the \(k\)-partitioning of graphs
Theory of Computing Systems | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086386 (Why is no real title available?) | 2004-08-11 | Paper |
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2038735 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1951555 (Why is no real title available?) | 2003-07-21 | Paper |
| scientific article; zbMATH DE number 1929963 (Why is no real title available?) | 2003-06-18 | Paper |
Diffusion schemes for load balancing on heterogeneous networks
Theory of Computing Systems | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1834674 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1696519 (Why is no real title available?) | 2002-07-22 | Paper |
| Compressing cube-connected cycles and butterfly networks | 2002-07-21 | Paper |
| scientific article; zbMATH DE number 1688366 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1795716 (Why is no real title available?) | 2002-01-01 | Paper |
Quality matching and local improvement for multilevel graph-partitioning
Parallel Computing | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1424534 (Why is no real title available?) | 2000-03-23 | Paper |
Efficient schemes for nearest neighbor load balancing
Parallel Computing | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1305097 (Why is no real title available?) | 1999-06-17 | Paper |
Embedding ladders and caterpillars into the hypercube
Discrete Applied Mathematics | 1999-02-14 | Paper |
Efficient schemes for nearest neighbor load balancing
Parallel Computing | 1999-01-01 | Paper |
Optimal embedding of complete binary trees into lines and grids
Journal of Parallel and Distributed Computing | 1998-08-20 | Paper |
| scientific article; zbMATH DE number 953275 (Why is no real title available?) | 1997-04-10 | Paper |
| scientific article; zbMATH DE number 828046 (Why is no real title available?) | 1996-06-06 | Paper |
| scientific article; zbMATH DE number 857072 (Why is no real title available?) | 1996-04-09 | Paper |
Broadcasting in butterfly and deBruijn networks
Discrete Applied Mathematics | 1995-03-08 | Paper |
Note on optimal gossiping in some weak-connected graphs
Theoretical Computer Science | 1995-02-09 | Paper |
Optimal algorithms for dissemination of information in generalized communication modes
Discrete Applied Mathematics | 1994-12-11 | Paper |
| scientific article; zbMATH DE number 512833 (Why is no real title available?) | 1994-03-10 | Paper |
Fast recognition of deterministic cfl's with a smaller number of processors
Theoretical Computer Science | 1993-10-17 | Paper |
Optimal algorithms for dissemination of information in some interconnection networks
Algorithmica | 1993-09-01 | Paper |
| scientific article; zbMATH DE number 219230 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176141 (Why is no real title available?) | 1993-05-18 | Paper |
On the parallel recognition of unambiguous context-free languages
Theoretical Computer Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4147467 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4205991 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4213420 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4064517 (Why is no real title available?) | 1988-01-01 | Paper |
Min Cut is NP-complete for edge weighted trees
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3956440 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4047097 (Why is no real title available?) | 1986-01-01 | Paper |
The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3974318 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3945345 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3976331 (Why is no real title available?) | 1985-01-01 | Paper |
Ramsey numbers and an approximation algorithm for the vertex cover problem
Acta Informatica | 1985-01-01 | Paper |
Solving satisfiability in less than \(2^ n\) steps
Discrete Applied Mathematics | 1985-01-01 | Paper |
Bandwidth contrained NP-complete problems
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3959477 (Why is no real title available?) | 1984-01-01 | Paper |
Deterministic two-way one-head pushdown automata are very powerful
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3853131 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3876620 (Why is no real title available?) | 1983-01-01 | Paper |
The complexity of determining a shortest cycle of even length
Computing | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3876618 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3876619 (Why is no real title available?) | 1982-01-01 | Paper |
On eliminating nondeterminism from Turing machines which use less than logarithm worktape space
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3744551 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3803174 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3756462 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3711409 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3690693 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3709579 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3739318 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3675313 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3569862 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3569829 (Why is no real title available?) | 1977-01-01 | Paper |
Transformational methods and their application to complexity problems. Corrigenda
Acta Informatica | 1977-01-01 | Paper |
On Optimal Control and Identification of Processes Governed by Parabolic Differential Equations of Second Order
ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik | 1977-01-01 | Paper |
A recursive and a grammatical characterization of the exponential-time languages
Theoretical Computer Science | 1977-01-01 | Paper |
The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet
Acta Informatica | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3581615 (Why is no real title available?) | 1976-01-01 | Paper |
Transformational methods and their application to complexity problems
Acta Informatica | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3532524 (Why is no real title available?) | 1975-01-01 | Paper |
Relationships between pushdown automata with counters and complexity classes
Mathematical Systems Theory | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3454792 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3449754 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3423575 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3444791 (Why is no real title available?) | 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)
Computing | 1970-01-01 | Paper |
