22nd European Workshop on Computational Geometry Institute of Software Technology 4th FSP-Seminar Industrial Geometry, March 2007 Maximizing Maximal Angles.
1 © 2012 Prof. Dr. Franz J. Brandenburg Graph Drawing main achievements and latest trends an update to 2002 Franz J. Brandenburg University of Passau.
Victor Zamaraev – Boundary properties of factorial classes of graphs
Graphic lambda calculus; 1305.5786v2.pdf
Eurecom, Sophia-Antipolis Thrasyvoulos Spyropoulos / [email protected] Random Graph Models: Create/Explain Complex Network Properties.
1 Midpoint Routing algorithms for Delaunay Triangulations Weisheng Si and Albert Y. Zomaya Centre for Distributed and High Performance Computing School.
Separatosr in the Real World Practice
P780.02 Spring 2003 L13Richard Kass Quantum Chromodynamics Quantum Chromodynamics (QCD) is the theory of the strong interaction. QCD is a non-abelian gauge.
6.853: Topics in Algorithmic Game Theory
Midpoint Routing algorithms for Delaunay Triangulations
Fixed parameter tractability and kernelization for the Maximum Leaf Weight Spanning Tree problem
The Ryjacek Closure and a Forbidden Subgraph Akira Saito (Nihon University, Japan) Liming Xiong (Beijing Institute of Technology, China)
