| Designing Reliable Algorithms in Unreliable Memories From Balanced Graph Partitioning to Balanced Metric Labeling Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism Exploring an Unknown Graph Efficiently Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut Relax-and-Cut for Capacitated Network Design On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games The Complexity of Games on Highly Regular Graphs Computing Equilibrium Prices: Does Theory Meet Practice? Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions An Algorithm for the SAT Problem for Formulae of Linear Length Linear-Time Enumeration of Isolated Cliques Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs Delineating Boundaries for Imprecise Regions EXACUS: Efficient and Exact Algorithms for Curves and Surfaces、 Min Sum Clustering with Penalties Improved Approximation Algorithms for Metric Max TSP Unbalanced Graph Cuts Low Degree Connectivity in Ad-Hoc Networks 5-Regular Graphs are 3-Colorable with Positive Probability Optimal Integer Alphabetic Trees in Linear Time Predecessor Queries in Constant Time? An Algorithm for Node-Capacitated Ring Routing On Degree Constrained Shortest Paths …… Author Index |
内容加载中，请稍后...
商品评论（0条）