The following pages link to Burkhard Monien (Q284584):
Displaying 50 items.
- The complexity of equilibria for risk-modeling valuations (Q284585) (← links)
- The complexity of pure equilibria in mix-weighted congestion games on parallel links (Q495670) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Fast recognition of deterministic cfl's with a smaller number of processors (Q685360) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- (Q800087) (redirect page) (← links)
- Deterministic two-way one-head pushdown automata are very powerful (Q800088) (← links)
- On the parallel recognition of unambiguous context-free languages (Q808269) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- The complexity of determining a shortest cycle of even length (Q1052821) (← links)
- Solving satisfiability in less than \(2^ n\) steps (Q1082830) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Optimal embedding of complete binary trees into lines and grids (Q1130317) (← links)
- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space (Q1168735) (← links)
- Transformational methods and their application to complexity problems (Q1227002) (← links)
- A recursive and a grammatical characterization of the exponential-time languages (Q1237361) (← links)
- The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet (Q1239007) (← links)
- Transformational methods and their application to complexity problems. Corrigenda (Q1241509) (← links)
- Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
- Optimal algorithms for dissemination of information in generalized communication modes (Q1339882) (← links)
- Broadcasting in butterfly and deBruijn networks (Q1339890) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- Embedding ladders and caterpillars into the hypercube (Q1392524) (← links)
- Quality matching and local improvement for multilevel graph-partitioning (Q1583343) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- Diffusion schemes for load balancing on heterogeneous networks (Q1849576) (← links)
- On spectral bounds for the \(k\)-partitioning of graphs (Q1879186) (← links)
- Error analysis in minimax trees (Q1885008) (← links)
- Sparse topologies with small spectrum size (Q1885049) (← links)
- On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment (Q1935800) (← links)
- The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
- (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions (Q2082560) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- Selfish routing with incomplete information (Q2471698) (← links)
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks (Q2503351) (← links)
- Über die Konvergenzordnung von Differenzenverfahren, die parabolische Anfangsrandwertaufgaben approximieren. (On the convergence ordre of difference methods approximating parabolic initial-boundary value problems) (Q2550278) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- Edge-disjoint spanning trees for the generalized butterfly networks and their applications (Q2575864) (← links)
- (Q2762507) (← links)
- (Q2766666) (← links)
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359) (← links)
- Exact Price of Anarchy for Polynomial Congestion Games (Q3115864) (← links)
- Routing (un-) splittable flow in games with player-specific affine latency functions (Q3189014) (← links)
- (Q3322143) (← links)
