Efficient exact geometric computation made easy
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data collection for the Sloan Digital Sky Survey—a network-flow heuristic
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Contig selection in physical mapping
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Uniform generation in spatial constraint databases and applications (Extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing approximate shortest paths on convex polytopes
Proceedings of the sixteenth annual symposium on Computational geometry
javax.XXL: a prototype for a library of query processing algorithms
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Multiprecision floating point addition
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Journal of Experimental Algorithmics (JEA)
Computing the width of a three-dimensional point set: an experimental study
Journal of Experimental Algorithmics (JEA)
An efficient algorithm for the configuration problem of dominance graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The design and implementation of panar maps in CGAL
Journal of Experimental Algorithmics (JEA)
An experimental study of priority queues in external memory
Journal of Experimental Algorithmics (JEA)
JGAP: a Java-based graph algorithms platform
Software—Practice & Experience
Theoretical Computer Science - Phase transitions in combinatorial problems
Automatic generation of staged geometric predicates
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Visualization of bibliographic networks with a reshaped landscape metaphor
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Fast spatial clustering with different metrics and in the presence of obstacles
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Exact minkowski sums and applications
Proceedings of the eighteenth annual symposium on Computational geometry
Improved construction of vertical decompositions of three-dimensional arrangements
Proceedings of the eighteenth annual symposium on Computational geometry
Optimal integrated code generation for clustered VLIW architectures
Proceedings of the joint conference on Languages, compilers and tools for embedded systems: software and compilers for embedded systems
A comparative study of modulo scheduling techniques
ICS '02 Proceedings of the 16th international conference on Supercomputing
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
ESOLID---A System for Exact Boundary Evaluation
Proceedings of the seventh ACM symposium on Solid modeling and applications
Smart dust protocols for local detection and propagation
Proceedings of the second ACM international workshop on Principles of mobile computing
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Polygon decomposition for efficient construction of Minkowski sums
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
High-Performance Algorithm Engineering for Computational Phylogenetics
The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
A D.C. biobjective location model
Journal of Global Optimization
Model Selection and Error Estimation
Machine Learning
Software—Practice & Experience
A decomposition-based approach to layered manufacturing
Computational Geometry: Theory and Applications
Constrained "Modern" Floorplanning
Proceedings of the 2003 international symposium on Physical design
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Root comparison techniques applied to computing the additively weighted Voronoi diagram
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Evolutionary Annealing Approach to Graph Coloring
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Mapping Graphs on the Sphere to the Finite Plane
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
High-Performance Algorithm Engineering for Computational Phylogenetics
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
MultiProt - A Multiple Protein Structural Alignment Algorithm
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Visual Ranking of Link Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Implementing Algorithms and Data Structures: An Educational and Research Perspective
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
The Engineering of Some Bipartite Matching Programs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An Improved Algorithm for Subdivision Traversal without Extra Storage
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Optimal Labelling of Point Features in the Slider Model
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Image Structure from Monotonic Dual Graph Contraction
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
CNOP - A Package for Constrained Network Optimization
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Experimental Evaluation of a New Shortest Path Algorithm
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
The Engineering of some Bipartite Matching Programs
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
On-Line Zone Construction in Arrangements of Lines in the Plane
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An Easy to Use Implementation of Linear Perturbations within CGAL
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Ten Years of LEDA Some Thoughts (Abstract)
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
LEDA-SM Extending LEDA to Secondary Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The Design and Implementation of Planar Maps in CGAL
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Designing and Implementing a General Purpose Halfedge Data Structure
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
An Adaptable and Extensible Geometry Kernel
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
From Algorithm to Program to Software Library
Informatics - 10 Years Back. 10 Years Ahead.
Tracking Multiple Moving Objects in Populated, Public Environments
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
GeoWin - A Generic Tool for Interactive Visualization of Geometric Algorithms
Revised Lectures on Software Visualization, International Seminar
Specifying Algorithm Visualizations: Interesting Events or State Mapping?
Revised Lectures on Software Visualization, International Seminar
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
k-Layer Straightline Crossing Minimization by Speeding Up Sifting
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Polygon Decomposition for Efficient Construction of Minkowski Sums
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Separation Bound for Real Algebraic Expressions
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
High-Level Filtering for Arrangements of Conic Arcs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
SCIL - Symbolic Constraints in Integer Linear Programming
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Design and Implementation of Efficient Data Types for Static Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Plane Embedding of Dually Contracted Graphs
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Fast Layout Methods for Timetable Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Building Expressive and Flexible Process Models Using a UML-Based Approach
EWSPT '01 Proceedings of the 8th European Workshop on Software Process Technology
Cycles in Generalized Networks
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Generating Organic Textures with Controlled Anisotropy and Directionality
IEEE Computer Graphics and Applications
Controlled perturbation for arrangements of circles
Proceedings of the nineteenth annual symposium on Computational geometry
Distributed communication algorithms for ad hoc mobile networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Voronoi Diagram for services neighboring a highway
Information Processing Letters
Visualization in algorithm engineering: tools and techniques
Experimental algorithmics
Distributed algorithm engineering
Experimental algorithmics
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Efficient Cartogram Generation: A Comparison
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Teaching algorithms and data structures: 10 personal observations
Computer Science in Perspective
Java applets for the dynamic visualization of Voronoi diagrams
Computer Science in Perspective
The reliable algorithmic software challenge RASC
Computer Science in Perspective
Asynchronous Scheduling of Redundant Disk Arrays
IEEE Transactions on Computers
Visualizing geographic information: VisualPoints vs CartoDraw
Information Visualization
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
Journal of Experimental Algorithmics (JEA)
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
Journal of Experimental Algorithmics (JEA)
An Experimental Study of Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
CartoDraw: A Fast Algorithm for Generating Contiguous Cartograms
IEEE Transactions on Visualization and Computer Graphics
A framework for designing and implementing the Ada standard container library
Proceedings of the 2003 annual ACM SIGAda international conference on Ada: the engineering of correct and reliable software for real-time & distributed systems using ada and related technologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 8th annual conference on Innovation and technology in computer science education
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
Speeding up the incremental construction of the union of geometric objects in practice
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Energy Efficient Protocols for Sensing Multiple Events in Smart Dust Networks
ANSS '04 Proceedings of the 37th annual symposium on Simulation
DAP: A Generic Platform for the Simulation of Distributed Algorithms
ANSS '04 Proceedings of the 37th annual symposium on Simulation
ANSS '04 Proceedings of the 37th annual symposium on Simulation
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Finding planar regions in a terrain: in practice and with a guarantree
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Complete, exact, and efficient computations with cubic curves
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Computing large planar regions in terrains, with an application to fracture surfaces
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Journal of Algorithms
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Mobile Networks and Applications
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Protocols for data propagation in wireless sensor networks
Wireless communications systems and networks
A generalization of the scaling max-flow algorithm
Computers and Operations Research
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Trading uninitialized space for time
Information Processing Letters
Cardinal directions between spatial objects: the pairwise-consistency problem
Information Sciences—Informatics and Computer Science: An International Journal
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks
Computers and Operations Research
Efficient and robust protocols for local detection and propagation in smart dust networks
Mobile Networks and Applications
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Vision pyramids that do not grow too high
Pattern Recognition Letters - Special issue: In memoriam Azriel Rosenfeld
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
IEEE Computer Graphics and Applications
Controlled perturbation for Delaunay triangulations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Topological Fisheye Views for Visualizing Large Graphs
IEEE Transactions on Visualization and Computer Graphics
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Structural filtering: a paradigm for efficient and exact geometric programs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Towards a Final Analysis of Pairing Heaps
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Optimal assignment kernels for attributed molecular graphs
ICML '05 Proceedings of the 22nd international conference on Machine learning
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Algorithms for precomputing constrained widest paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Verification of an Off-Line Checker for Priority Queues
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
An approximate arrangement algorithm for semi-algebraic curves
Proceedings of the twenty-second annual symposium on Computational geometry
Semi-matchings for bipartite graphs and load balancing
Journal of Algorithms
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Sweep synchronization as a global propagation mechanism
Computers and Operations Research
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
Routing protocols for efficient communication in wireless ad-hoc networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
Journal of Parallel and Distributed Computing
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
Heuristics for estimating contact area of supports in layered manufacturing
Journal of Experimental Algorithmics (JEA)
Implementing minimum cycle basis algorithms
Journal of Experimental Algorithmics (JEA)
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Handling degeneracies in exact boundary evaluation
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
An intersection-sensitive algorithm for snap rounding
Computational Geometry: Theory and Applications
Sliver-free perturbation for the Delaunay tetrahedrization
Computer-Aided Design
Efficient algorithm for placing a given number of base stations to cover a convex region
Journal of Parallel and Distributed Computing
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Journal of Parallel and Distributed Computing
Taking students out for a ride: using a board game to teach graph theory
Proceedings of the 38th SIGCSE technical symposium on Computer science education
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
LYDIAN: An extensible educational animation environment for distributed algorithms
Journal on Educational Resources in Computing (JERIC)
An exact, complete and efficient computation of arrangements of Bézier curves
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Proceedings of the 6th international conference on Information processing in sensor networks
Discrete Applied Mathematics
Discrete Applied Mathematics
Exact and approximate construction of offset polygons
Computer-Aided Design
Snap rounding of Bézier curves
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
An adaptable and extensible geometry kernel
Computational Geometry: Theory and Applications
Advanced programming techniques applied to Cgal's arrangement package
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
A package for exact kinetic data structures and sweepline algorithms
Computational Geometry: Theory and Applications
Distance Patterns in Structural Similarity
The Journal of Machine Learning Research
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers and Operations Research
Reliable and efficient geometric computing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Exact and efficient construction of planar Minkowski sums using the convolution method
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Library composition and adaptation using c++ concepts
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Reducing rank-maximal to maximum weight matching
Theoretical Computer Science
BioRoute: a network-flow based routing algorithm for digital microfluidic biochips
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Classroom examples of robustness problems in geometric computations
Computational Geometry: Theory and Applications
Exact and efficient 2D-arrangements of arbitrary algebraic curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Toward superrobust geometric computation
Proceedings of the 2008 ACM symposium on Solid and physical modeling
The GNU libstdc++ parallel mode: software engineering considerations
Proceedings of the 1st international workshop on Multicore software engineering
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
Efficient network flow based ratio-cut netlist hypergraph partitioning
ICECS'03 Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Proceedings of the 45th annual Design Automation Conference
Improving the topology computation of an arrangement of cubics
Computational Geometry: Theory and Applications
Reliable Implementation of Real Number Algorithms: Theory and Practice
A Fast and Efficient Algorithm for Topology-Aware Coallocation
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Computational Study on Dominating Set Problem of Planar Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
How Reliable Are Practical Point-in-Polygon Strategies?
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
An efficient local approach to convexity testing of piecewise-linear hypersurfaces
Computational Geometry: Theory and Applications
Tools and algorithms for refined comparison of protein structures
MINO'07 Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics
Graph Simultaneous Embedding Tool, GraphSET
Graph Drawing
An Improved Upward Planarity Testing Algorithm and Related Applications
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Thermal-aware floorplanning for task migration enabled active sub-threshold leakage reduction
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Reliable routings in networks with generalized link failure events
IEEE/ACM Transactions on Networking (TON)
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Biclustering Expression Data Based on Expanding Localized Substructures
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Dialogue patterns-A visual language for dynamic dialogue
Journal of Visual Languages and Computing
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
Communications of the ACM - A View of Parallel Computing
Goal-directed shortest-path queries using precomputed cluster distances
Journal of Experimental Algorithmics (JEA)
Lists revisited: Cache-conscious STL lists
Journal of Experimental Algorithmics (JEA)
Engineering planar separator algorithms
Journal of Experimental Algorithmics (JEA)
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Adaptable component frameworks: using vector from the C++ standard library as an example
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics
Crossing minimization in weighted bipartite graphs
Journal of Discrete Algorithms
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry: Theory and Applications
Computational study on planar dominating set problem
Theoretical Computer Science
Structural filtering: a paradigm for efficient and exact geometric programs
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Computer-Aided Design
A barcode shape descriptor for curve point cloud data
Computers and Graphics
Energy-efficient routing for signal detection in wireless sensor networks
IEEE Transactions on Signal Processing
Attributed relational graph matching based on the nested assignment structure
Pattern Recognition
Delay-optimal server allocation in multiqueue multiserver systems with time-varying connectivities
IEEE Transactions on Information Theory
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Discrete Applied Mathematics
Semi-matchings for bipartite graphs and load balancing
Journal of Algorithms
Maintaining dynamic minimum spanning trees: An experimental study
Discrete Applied Mathematics
A quality model for the Ada standard container library
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Deterministic pharmacophore detection via multiple flexible alignment of drug-like molecules
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
On the reliability of triangle intersection in 3D
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Algorithms and experiments on colouring squares of planar graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Analysis and visualization of social networks
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Crossing minimization in weighted bipartite graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Engineering algorithms for approximate weighted matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Computing the topology of an arrangement of quartics
Proceedings of the 12th IMA international conference on Mathematics of surfaces XII
Science of Computer Programming
Iterative software engineering for multiagent systems: the MASSIVE method
Iterative software engineering for multiagent systems: the MASSIVE method
A lagrangian relaxation approach for the multiple sequence alignment problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Checking value-sensitive data structures in sublinear space
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
PFP: a computational framework for phylogenetic footprinting in prokaryotic genomes
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Pregel: a system for large-scale graph processing
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A replicated and refined empirical study of the use of friends in C++ software
Journal of Systems and Software
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Reliable and efficient geometric computing
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
A simulation environment for ad hoc networks using sector subdivision
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Shortest path and maximum flow problems in networks with additive losses and gains
Theoretical Computer Science
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Connectivity in the regular polytope representation
Geoinformatica
LEMON - an Open Source C++ Graph Template Library
Electronic Notes in Theoretical Computer Science (ENTCS)
A general approach to the analysis of controlled perturbation algorithms
Computational Geometry: Theory and Applications
An experimental comparison of single-sided preference matching algorithms
Journal of Experimental Algorithmics (JEA)
An experimental study on generating planar graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Verification of certifying computations
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Algorithms for wireless sensor networks: design, analysis and experimental evaluation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Lists revisited: cache conscious STL lists
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Goal directed shortest path queries using precomputed cluster distances
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Placing a given number of base stations to cover a convex region
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Using three-valued logic to specify and verify algorithms of computational geometry
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An experimental study of algorithms for fully dynamic transitive closure
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Experimental study of geometric t-spanners
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Engineering planar separator algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Regulatory network reconstruction using stochastic logical networks
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Dependable polygon-processing algorithms for safety-critical embedded systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Reliable routings in networks with generalized link failure events
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Partitioning planar graphs: a fast combinatorial approach for max-cut
Computational Optimization and Applications
Experiments on union-find algorithms for the disjoint-set data structure
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Replicated server placement with qos constraints
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Reliable and efficient computational geometry via controlled perturbation
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Discovery of protein substructures in EM maps
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Lock-Free parallel algorithms: an experimental study
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Graph theoretical insights into evolution of multidomain proteins
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Implementing minimum cycle basis algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Partitioning graphs to speed up dijkstra's algorithm
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient convergence to pure nash equilibria in weighted network congestion games
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Generating and radiocoloring families of perfect graphs
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Selecting the roots of a small system of polynomial equations by tolerance based matching
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A MOF-compliant approach to software quality modeling
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Crossover can provably be useful in evolutionary computation
Theoretical Computer Science
Managing uncertainty in schema matching with top-k schema mappings
Journal on Data Semantics VI
Optimisation problems based on the maximal breach path measure for wireless sensor network coverage
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
An important connection between network motifs and parsimony models
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Exact medial axis computation for circular arc boundaries
Proceedings of the 7th international conference on Curves and Surfaces
Computational study on bidimensionality theory based algorithm for longest path problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computer Science Review
Computer Science Review
Tree decompositions of graphs: Saving memory in dynamic programming
Discrete Optimization
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
A barcode shape descriptor for curve point cloud data
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge
Journal of Graph Theory
Density index and proximity search in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
Push-relabel based algorithms for the maximum transversal problem
Computers and Operations Research
SmipRef: An efficient method for multi-domain clock skew scheduling
Integration, the VLSI Journal
The weak-heap family of priority queues in theory and praxis
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Exact and efficient generation of geometric random variates and random graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A Framework for the Verification of Certifying Computations
Journal of Automated Reasoning
| Hi-index | 0.07 |