Experimental Algorithms, Route Planning in Transportation Networks. Algorithm Engineering, Algorithmic Aspects of the S-Labeling Problem. Combinatorial Algorithms, ACM Transactions on Algorithms 12 :1, The Computer Journal 58 , Journal of Parallel and Distributed Computing 85 , Journal of Discrete Algorithms 35 , Discrete Mathematics :8, Swarm and Evolutionary Computation 20 , Optimization Letters 9 :2, European Journal of Operational Research :2, On Balanced Separators in Road Networks. Algorithms - ESA , Treasure Hunt with Advice.
Structural Information and Communication Complexity, Algorithms and Computation, Synthesis Lectures on Theoretical Computer Science 1 :1, Remote Sensing 6 , Electronic Notes in Discrete Mathematics 46 , Theory of Computing Systems 55 :2, Journal of Global Optimization 59 , ACM Computing Surveys 46 :4, Hsueh-I Lu. Journal of Computational Science 5 :1, Journal of Network and Computer Applications 37 , Expositiones Mathematicae 32 :4, Automata, Languages, and Programming, Mathematical Foundations of Computer Science , Handbook of Graph Theory, Second Edition, International Journal of Foundations of Computer Science 24 , Computational Geometry 46 :7, Journal of Parallel and Distributed Computing 73 :7, Computational Geometry 46 :3, Sergio Cabello , Erin W.
Chambers , and Jeff Erickson. Handbook of Combinatorial Optimization, Advances in Spatial Data Handling, Thirty Essays on Geometric Graph Theory, Bandwidth, Vertex Separators, and Eigenvalue Optimization. Discrete Geometry and Optimization, Algorithmic Learning Theory, Introductory Graph and Metric Notions.
Coarse Geometry and Randomness, Computational Geometry 45 :7, European Journal of Combinatorics 33 :5, Algorithmica 63 :3, Algorithmica 63 , Reliability and Maintenance, European Journal of Combinatorics 33 :3, Algorithmica 62 , Combinatorial Problems in Solving Linear Systems. Combinatorial Scientific Computing, Computational Optimization and Applications 51 :1, Weighted Matching. Combinatorial Optimization, Preserving Terminal Distances Using Minors. Planarizing an Unknown Surface. Approximation, Randomization, and Combinatorial Optimization.
Algorithms and Techniques, Fixed-Parameter Tractability of Treewidth and Pathwidth. The Multivariate Algorithmic Revolution and Beyond, Computational Geometry 44 :9, Planar Graphs. Graph Coloring Problems, Combinatorial Geometry, Geometric and Functional Analysis 21 :5, Advanced Engineering Forum 1 , Theory and Practice of Logic Programming 11 , Bulletin of Mathematical Biology 73 :6, Journal of Mathematical Chemistry 49 :4, Journal of Computer and System Sciences 77 :2, Information Processing Letters :5, Computational Geometry 44 :2, Towards an Information Theory of Complex Networks, Wireless Networks 17 :1, Some Applications of Eigenvalues of Graphs.
Structural Analysis of Complex Networks, Improved Distance Queries in Planar Graphs. Computing and Combinatorics, Search Based Software Engineering, Automata, Languages and Programming, Graph-Theoretic Concepts in Computer Science, On Approximating the d-Girth of a Graph. Matching Pesato. Ottimizzazione Combinatoria, Algorithmica 58 :3, Geometriae Dedicata :1, European Journal of Combinatorics 31 :5, Algorithmica 57 :1, Combinatorics, Probability and Computing 19 , Advances in Mathematics :6, Discrete Applied Mathematics :7, Algorithmica 56 :4, David Eppstein , Michael T.
Goodrich , and Darren Strash. Journal of Combinatorial Theory, Series B :1, Computer Methods in Applied Mechanics and Engineering , Frontiers in Algorithmics, Transitive-Closure Spanners: A Survey. Property Testing, Couplage avec poids. Optimisation combinatoire, Event Extent Estimation. Succinct Representations of Separable Graphs. Combinatorial Pattern Matching, Path Separability of Graphs.
Information Security and Privacy, Sublinear Graph Approximation Algorithms. Extremal Problems for Sparse Graphs. An Irregular Mind, Computational Geometry 42 :9, Algorithms 2 :3, Journal of Computer and Systems Sciences International 48 :4, International Journal of Geographical Information Science 23 :6, Electronic Notes in Discrete Mathematics 32 , Discrete Applied Mathematics :4, Efficient Algorithms, Electronic Notes in Discrete Mathematics 31 , Combinatorics, Probability and Computing 17 Discrete Optimization 5 :2, Journal of Combinatorial Optimization 15 :4, Algorithmic aspects.
European Journal of Combinatorics 29 :3, Combinatorics, Probability and Computing 17 :2, Discrete Applied Mathematics :3, Anil Maheshwari and Norbert Zeh. Journal of Combinatorial Theory, Series B 98 :1, Structural Properties of Sparse Graphs. Building Bridges, Journal of Discrete Algorithms 5 :3, Artificial Intelligence , Electronic Notes in Discrete Mathematics 28 , Linear Algebra and its Applications , Computational Geometry 36 :2, Bin Fu and Wei Wang.
Exact Max 2-Sat: Easier and Faster. Almost Exact Matchings. The International Journal of Robotics Research 25 , Computational Geometry 35 :3, Journal of Computer and System Sciences 72 :5, Operations Research Letters 34 :3, Algorithmica 45 :1, Journal of Combinatorial Optimization 11 :2, Theoretical Computer Science :3, Jonathan A. SIAM Review 48 :1, Algorithmic Aspects in Information and Management, STACS , On the Minimum Load Coloring Problem.
Journal of Graph Theory 51 :1, Operations Research Letters 33 :6, Journal of Computer and System Sciences 71 :1, Mathematical Programming :3, Maximum Order of Planar Digraphs. Combinatorial Geometry and Graph Theory, Algorithms — ESA , Engineering Planar Separator Algorithms. Journal of Algorithms 53 :2, Journal of Algorithms 52 :2, Journal of Algorithms 52 :1, Parameterized Graph Separation Problems.
Parameterized and Exact Computation, Boundary-Optimal Triangulation Flooding. Journal of Computer and System Sciences 67 :4, Discrete Applied Mathematics :1, Journal of Algorithms 46 :2, Computational Geometry 24 :2, Algorithmic Aspects of Tree Width. Recent Advances in Algorithms and Combinatorics, Combinatorial Optimization — Eureka, You Shrink! Constructing Sparse t-Spanners with Small Separators.
Fundamentals of Computation Theory, Computer Graphics Forum 21 :2, Partitioning Planar Graphs with Costs and Weights. Algorithm Engineering and Experiments, Opportunity Cost Algorithms for Combinatorial Auctions. Journal of Algorithms 41 :1, Theoretical Computer Science :2, Journal of Combinatorial Theory, Series B 82 :1, Journal of Algorithms 38 :1, Numerical linear algebra algorithms and software.
Numerical Analysis: Historical Developments in the 20th Century, Handbook of Randomized Computing, Hierarchical Clustering of Trees: Algorithms and Experiments. Algorithm Engineering and Experimentation, Information Hiding, Graph Separators: A Parameterized View. Applied Mathematical Modelling 25 :2, Journal of Computational and Applied Mathematics , Journal of Parallel and Distributed Computing 60 :9, Journal of Algorithms 34 :2, Kasturi R.
Varadarajan and Pankaj K. Planar Graph Blocking for External Searching. Computing the Girth of a Planar Graph. Crossing Numbers. Discrete and Computational Geometry, Journal of Computer Science and Technology 14 :5, Graph Drawing, Graph Planarity and Related Topics. External Memory Algorithms for Outerplanar Graphs. On Bounds for the k-Partitioning of Graphs. Theoretical Computer Science :1, Journal of Algorithms 28 :2, Discrete Applied Mathematics 84 , Computational Geometry 9 :4, Journal of Algorithms 26 :2, Simulation Practice and Theory 6 :1, Spectral techniques in graph algorithms.
Minimal elimination of planar graphs. Communication complexity and lower bounds on multilective computations. Min-Max-Boundary Domain Decomposition. Combinatoral Optimization in Clustering. Discrete Applied Mathematics 79 , Journal of Computer and System Sciences 55 :1, Theory of Computing Systems 30 :1, Improved approximations for minimum cardinality quadrangulations of finite element meshes.
Algorithms — ESA '97, Efficient Union-Find for planar graphs and other sparse graph classes. Visibility-based pursuit-evasion in a polygonal environment. Dynamically switching vertices in planar graphs. Weighted graph separators and their applications. Parallel Numerical Algorithms, Algorithmica 16 :1, Parallel Algorithms and Applications 8 :1, Fast separator decomposition for finite element meshes.
Planar spanners and approximate shortest path queries among obstacles in the plane. Algorithms — ESA '96, Extremal problems for geometric hypergraphs. A simple parallel algorithm for the single-source shortest path problem on planar digraphs. Parallel Algorithms for Irregularly Structured Problems, Combinatorics, Probability and Computing 4 , Discrete Applied Mathematics 61 :2, Andrew V.
Computational Complexity 5 :1, Ming-Yang Kao. Chapter 3 Matching. Network Models, Chapter 8 Algorithmic implications of the graph minor theorem. Chapter 8 VLSI network design. Network Routing, On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks. STACS 95, Planarization of graphs embedded on surfaces. Linear-time algorithms for parametric minimum spanning tree problems on planar graphs. New approximation results on graph matching and related problems.
Discrete Mathematics , Discrete Applied Mathematics 54 , Journal of Graph Theory 18 :3, Journal of Global Optimization 4 :3, Multirate and Wavelet Signal Processing. Bruce W. Handbook of Computer Aided Geometric Design. Network Analysis and Synthesis. Sumeth Vongpanitlerd.
A Textbook of Graph Theory. Mohamed Najim. Taming Heterogeneity and Complexity of Embedded Control. Antonio Loria. The Art of Mathematics. Multiresolution Signal Decomposition. Ali N. A Tale of Two Fractals. Control Methods for Electrical Machines. Rene Husson. Lourenco Beirao da Veiga. Stu Schwartz. Introduction to Random Graphs. Alan Frieze. Fundamentals of Robotic Mechanical Systems. Jorge Angeles. Planning Algorithms. Steven M. Sampling Theory. Yonina C. Stabilization of Navier—Stokes Flows. Viorel Barbu. Graph Theory on Demand Printing Of Frank Harary.
Topics in Structural Graph Theory. Robin Wilson. Matroids: A Geometric Introduction. Gary Gordon.
Computational Kinematics. Federico Thomas.
Stefan Felsner's Publications
Vladimir Rovenski. Anton A. Mathematical Control Theory I. Kanat Camlibel. Bongsob Song. Symmetry and Pattern in Projective Geometry. Eric Lord. Blind Image Deconvolution. Subhasis Chaudhuri. Omnidirectional Vision Systems. Luis Puig. Theodore G. Arjan van der Schaft. Graphs of Groups on Surfaces. Conformal Field Theories and Tensor Categories.
Chengming Bai. Subdivision Surface Modeling Technology. Wenhe Liao. Surveys in Combinatorics Simon R. Introduction to Combinatorics. Martin J. Hypergraph Theory. Alain Bretto.
Peter J. Automated Deduction in Geometry. Francisco Botana. Finite Geometry and Combinatorial Applications. Simeon Ball. Topics in Multivariate Approximation and Interpolation. Kurt Jetter. Inequalities for Graph Eigenvalues. Mathematics and Modern Art.
Submitted and accepted
Claude Bruter. Crossing Numbers of Graphs. Marcus Schaefer. Beiwei Zhang.
Thirty Essays on Geometric Graph Theory : Janos Pach :
Recent Results on Time-Delay Systems. Emmanuel Witrant. Optimal Interconnection Trees in the Plane. Marcus Brazil. Rational Bases and Generalized Barycentrics. Eugene Wachspress. Mesh Generation.
Pascal Frey. A Journey Through Discrete Mathematics. Martin Loebl. Topics in Theoretical Computer Science. Mohammad Reza Mousavi. Graph-Theoretic Concepts in Computer Science. Hans L.