Data structures and network algorithms
Data structures and network algorithms
Algorithms
Introduction to algorithms
Data abstraction and object-oriented programming in C++
Data abstraction and object-oriented programming in C++
Algorithms and data structures: with applications to graphics and geometry
Algorithms and data structures: with applications to graphics and geometry
Data structures, algorithms, and performance
Data structures, algorithms, and performance
Computational geometry in C
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Data Structures and C Programs, 2nd Ed. (Addison-Wesley Series in Computer Science)
Data Structures and C Programs, 2nd Ed. (Addison-Wesley Series in Computer Science)
Algorithms and Data Structures: Design, Correctness, Analysis
Algorithms and Data Structures: Design, Correctness, Analysis
Software Component with ADA
Data Structures and Algorithms
Data Structures and Algorithms
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Exact geometric computation in LEDA
Proceedings of the eleventh annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
Maintenance of the set of segments visible from a moving viewpoint in two dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Mesh refinement via bidirected flows: modeling, complexity, and computational results
Journal of the ACM (JACM)
Accelerated occlusion culling using shadow frusta
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A computational basis for higher-dimensional computational geometry and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Classical computational geometry in GeomNet
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computing the minimum diameter for moving points: an exact implementation using parametric search
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Reuse of algorithms: still a challenge to object-oriented programming
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Journal of the ACM (JACM)
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A branch-and-cut algorithm for multiple sequence alignment
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
The deferred path heuristic for the generalized tree alignment problem
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Improving discrete mathematics and algorithms curricula with LINK
Proceedings of the 2nd conference on Integrating technology into computer science education
Designing a data structure for polyhedral surfaces
Proceedings of the fourteenth annual symposium on Computational geometry
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Constructing cuttings in theory and practice
Proceedings of the fourteenth annual symposium on Computational geometry
Point set labeling with sliding labels
Proceedings of the fourteenth annual symposium on Computational geometry
A unified approach to labeling graphical features
Proceedings of the fourteenth annual symposium on Computational geometry
GAWAIN: visualizing geometric algorithms with Web-based animation
Proceedings of the fourteenth annual symposium on Computational geometry
A polyhedral approach to RNA sequence structure alignment
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
DIDAGRAPH: software for teaching graph theory algorithms
ITiCSE '98 Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education
Greeding matching algorithms, an experimental study
Journal of Experimental Algorithmics (JEA)
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
An algorithm for clustering cDNAs for gene expression analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
A core library for robust numeric and geometric computation
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
An empirical study of dynamic graph algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Runtime prediction of real programs on real machines
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A strong and easily computable separation bound for arithmetic expressions involving square roots
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Exact arithmetic at low cost—a case study in linear programming
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The full degree spanning tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Optimal robot localization in trees
Proceedings of the sixteenth annual symposium on Computational geometry
Journal of Experimental Algorithmics (JEA)
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
A software engineering perspective on algorithmics
ACM Computing Surveys (CSUR)
Optimal robot localization in trees
Information and Computation
Graph-partitioning based instruction scheduling for clustered processors
Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture
A D.C. biobjective location model
Journal of Global Optimization
Graph Applications in Programming
Programming and Computing Software
VisualGraph: a graph class designed for both undergraduate students and educators
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
GeomNet: Geometric Computing over the Internet
IEEE Internet Computing
Robust Geometric Computation Based on Topological Consistency
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Optimal Compaction of Orthogonal Grid Drawings
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
What Do We Learn from Experimental Algorithmics?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Object-Oriented Design of Graph Oriented Data Structures
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Accessing the Internal Organization of Data Structures in the JDSL Library
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Partitioning Planar Graphs with Costs and Weights
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Protecting Facets in Layered Manufacturing
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Evaluation of Buffer Queries in Spatial Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An Experimental Study of Priority Queues in External Memory
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
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
A Data Abstraction Alternative to Data Structure/Algorithm Modularization
Selected Papers from the International Seminar on Generic Programming
An Experimental Study of Dynamic Algorithms for Directed Graphs
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On Constructing Suffix Arrays in External Memory
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Drawing Hypergraphs in the Subset Standard (Short Demo Paper)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Performance Evaluation of Connectionless Overlay Networks for ATM
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
Algorithm animation over the World Wide Web
AVI '96 Proceedings of the workshop on Advanced visual interfaces
Parallel bulk-loading of spatial data
Parallel Computing - Special issue: High performance computing with geographical data
Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
Information Processing Letters
A pathway editor for literature-based knowledge curation
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Graph traversal and graph transformation
Theoretical Computer Science
GUESS: a language and interface for graph exploration
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
On-line maintenance of simplified weighted graphs for efficient distance queries
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Algorithms for the multiple label placement problem
Computational Geometry: Theory and Applications
High-level synthesis of DSP applications using adaptive negative cycle detection
EURASIP Journal on Applied Signal Processing
Efficient composite pattern finding from monad patterns
International Journal of Bioinformatics Research and Applications
Multilevel algorithms for linear ordering problems
Journal of Experimental Algorithmics (JEA)
Reliable Implementation of Real Number Algorithms: Theory and Practice
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Lower bounds for zero-dimensional projections
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Fully Decentralized, Collaborative Multilateration Primitives for Uniquely Localizing WSNs
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Algorithms for the multiple label placement problem
Computational Geometry: Theory and Applications
Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Linear time local improvements for weighted matchings in graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
SC'08 Proceedings of the 7th international conference on Software composition
GTNA: a framework for the graph-theoretic network analysis
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Algorithms and theory of computation handbook
The design of core 2: a library for exact numeric computation in geometry and algebra
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Computer Science Review
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
ACM Transactions on Storage (TOS)
| Hi-index | 48.23 |
Combinatorial and geometric computing is a core area of computer science (CS). In fact, most CS curricula contain a course in data structures and algorithms. The area deals with objects such as graphs, sequences, dictionaries, trees, shortest paths, flows, matchings, points, segments, lines, convex hulls, and Voronoi diagrams and forms the basis for application areas such as discrete optimization, scheduling, traffic control, CAD, and graphics. There is no standard library of the data structures and algorithms of combinatorial and geometric computing. This is in sharp contrast to many other areas of computing. There are, for example, packages in statistics (SPSS), numerical analysis (LINPACK, EISPACK), symbolic computation (MAPLE, MATHEMATICA), and linear programming (CPLEX).