IEEE Annals of the History of Computing - Special issue on Central and Eastern Europe
On the design of efficient ATM routing schemes
Theoretical Computer Science
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Wavelength routing in optical networks of diameter two
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Partitioning Planar Graphs with Costs and Weights
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
An O(n4) time algorithm to compute the bisection width of solid grid graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the minimum load coloring problem
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Boundary-Optimal triangulation flooding
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Fast balanced partitioning is hard even on grids and trees
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
| Hi-index | 0.00 |