Search

Your search keyword '"Mihalis Yannakakis"' showing total 58 results

Search Constraints

Start Over You searched for: Author "Mihalis Yannakakis" Remove constraint Author: "Mihalis Yannakakis" Topic combinatorics Remove constraint Topic: combinatorics
58 results on '"Mihalis Yannakakis"'

Search Results

1. Planar graphs that need four pages

2. Smoothed complexity of local max-cut and binary max-CSP

3. Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata

4. Doubly Balanced Connected Graph Partitioning

5. Quasi-Birth–Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

6. Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

7. On the Complexity of Nash Equilibria and Other Fixed Points

8. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

9. Efficiently computing succinct trade-off curves

10. Multiway cuts in node weighted graphs

11. Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

12. Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

13. Primal-dual approximation algorithms for integral flow and multicut in trees

14. A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing

15. On Limited Nondeterminism and the Complexity of the V-C Dimension

16. On the Approximation of Maximum Satisfiability

17. The Complexity of Multiterminal Cuts

18. The Traveling Salesman Problem with Distances One and Two

19. Optimization, approximation, and complexity classes

20. Modularity of cycles and paths in graphs

21. Simple Local Search Problems that are Hard to Solve

22. High-Probability Parallel Transitive-Closure Algorithms

23. The input/output complexity of transitive closure

24. Algorithmic Verification of Recursive Probabilistic State Machines

25. On recognizing integer polyhedra

26. Existence of reduction hierarchies

27. Searching a fixed graph

28. The approximation of maximum subgraph problems

29. Approximate max-flow min-(multi)cut theorems and their applications

30. On the hardness of approximating minimization problems

31. The complexity of multiway cuts (extended abstract)

32. Suboptimal cuts: Their enumeration, weight and number

33. Linear approximation of shortest superstrings

34. High-probability parallel transitive closure algorithms

35. The maximum k-colorable subgraph problem for chordal graphs

36. The node-deletion problem for hereditary properties is NP-complete

37. Edge Dominating Sets in Graphs

38. On a Class of Totally Unimodular Matrices

39. On generating all maximal independent sets

40. Node-Deletion Problems on Bipartite Graphs

41. Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs

42. The Complexity of the Partial Order Dimension Problem

43. Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum

44. The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems

45. A polynomial algorithm for the min-cut linear arrangement of trees

46. The complexity of restricted spanning tree problems

47. Edge-Deletion Problems

49. Topological characterization of families of graphs generated by certain types of graph grammars

50. On Datalog vs Polynomial Time

Catalog

Books, media, physical & digital resources