SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient generation of all regular non-dominated coteries
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Enumerating order types for small sets with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Notes on acyclic orientations and the shelling lemma
Theoretical Computer Science
Exact from-region visibility culling
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
Sequences of spanning trees and a fixed tree theorem
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
On local transformation of polygons with visibility properties
Theoretical Computer Science
Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Optimization over k-set Polytopes and Efficient k-set Enumeration
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On Local Transformation of Polygons with Visibility Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
How to Employ Reverse Search in Distributed Single Source Shortest Paths
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Computing Largest Common Point Sets under Approximate Congruence
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Output-sensitive cell enumeration in hyperplane arrangements
Nordic Journal of Computing
An efficient algorithm for enumeration of triangulations
Computational Geometry: Theory and Applications
Computing irredundant irreducible decompositions of large scale monomial ideals
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Scalable custom instructions identification for instruction-set extensible processors
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
A lower bound on the number of triangulations of planar point sets
Computational Geometry: Theory and Applications
Abstract order type extension and new results on the rectilinear crossing number
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Enumerating pseudo-triangulations in the plane
Computational Geometry: Theory and Applications
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Transforming spanning trees and pseudo-triangulations
Information Processing Letters
h-Assignments of simplicial complexes and reverse search
Discrete Applied Mathematics
On the number of rectangulations of a planar point set
Journal of Combinatorial Theory Series A
Abstract order type extension and new results on the rectilinear crossing number
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
A quadratic distance bound on sliding between crossing-free spanning trees
Computational Geometry: Theory and Applications
Information Processing Letters
Methodology for competitive strategy development
Computers and Operations Research
On local transformations in plane geometric graphs embedded on small grids
Computational Geometry: Theory and Applications
Discrete Applied Mathematics
Fast enumeration algorithms for non-crossing geometric graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
Optimal complexity reduction of polyhedral piecewise affine systems
Automatica (Journal of IFAC)
Computational Geometry: Theory and Applications
Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Pattern search in the presence of degenerate linear constraints
Optimization Methods & Software
Planar tree transformation: Results and counterexample
Information Processing Letters
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Generating All Triangulations of Plane Graphs (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
On the diameter of geometric path graphs of points in convex position
Information Processing Letters
Generating all distributions of objects to bins
International Journal of Computer Mathematics
A scalable, parallel algorithm for maximal clique enumeration
Journal of Parallel and Distributed Computing
Enumeration aspects of maximal cliques and bicliques
Discrete Applied Mathematics
Enumeration of finite monomial orderings and combinatorics of universal Gröbner bases
Programming and Computing Software
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Generalized Pattern Search methods for a class of nonsmooth optimization problems with structure
Journal of Computational and Applied Mathematics
Transforming spanning trees: A lower bound
Computational Geometry: Theory and Applications
Reverse search for monomial ideals
Journal of Symbolic Computation
Multi-way set enumeration in real-valued tensors
Proceedings of the 2nd Workshop on Data Mining using Matrices and Tensors
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
Discrete Applied Mathematics
Enumerating pseudo-triangulations in the plane
Computational Geometry: Theory and Applications
Mining Frequent Bipartite Episode from Event Sequences
DS '09 Proceedings of the 12th International Conference on Discovery Science
Note: h-Assignments of simplicial complexes and reverse search
Discrete Applied Mathematics
Transforming spanning trees and pseudo-triangulations
Information Processing Letters
Efficient enumeration of all ladder lotteries and its application
Theoretical Computer Science
The number of triangulations on planar point sets
GD'06 Proceedings of the 14th international conference on Graph drawing
Efficient mode enumeration of compositional hybrid systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Time and space efficient discovery of maximal geometric graphs
DS'07 Proceedings of the 10th international conference on Discovery science
An efficient polynomial delay algorithm for pseudo frequent itemset mining
DS'07 Proceedings of the 10th international conference on Discovery science
An efficient algorithm for enumerating pseudo cliques
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Mining correlated subgraphs in graph databases
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Ambiguous frequent itemset mining and polynomial delay enumeration
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Mining maximal flexible patterns in a sequence
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
IEEE Transactions on Information Theory
Journal of Global Optimization
Mining frequent k-partite episodes from event sequences
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Parallel extreme ray and pathway computation
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
Mathematics of Operations Research
Transforming Triangulations on Nonplanar Surfaces
SIAM Journal on Discrete Mathematics
Optimizing regular edge labelings
GD'10 Proceedings of the 18th international conference on Graph drawing
Optimal solutions for the balanced minimum evolution problem
Computers and Operations Research
On fast enumeration of pseudo bicliques
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Efficient view point selection for silhouettes of convex polyhedra
Computational Geometry: Theory and Applications
Counting plane graphs with exponential speed-up
Rainbow of computer science
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science
Parallel enumeration of lattice animals
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
LGM: mining frequent subgraphs from linear graphs
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Connecting a set of circles with minimum sum of radii
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Output-sensitive listing of bounded-size trees in undirected graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Listing chordal graphs and interval graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Enumerating non-crossing minimally rigid frameworks
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A step-by-step extending parallelism approach for enumeration of combinatorial objects
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
On zero duality gap in nonconvex quadratic programming problems
Journal of Global Optimization
Forest search: a paradigm for faster exploration of scale-free networks
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Generation of polyiamonds for p6 tiling by the reverse search
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
Reachability determination in acyclic Petri nets by cell enumeration approach
Automatica (Journal of IFAC)
On duality gap in binary quadratic programming
Journal of Global Optimization
Mutual exclusion by interpolation
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Technical Section: Analytic ambient occlusion using exact from-polygon visibility
Computers and Graphics
A low dimensional framework for exact polygon-to-polygon occlusion queries
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
Fast exact from-region visibility in urban scenes
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
On reduction of duality gap in quadratic knapsack problems
Journal of Global Optimization
Enumerating constrained non-crossing geometric spanning trees
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
The lazy flipper: efficient depth-limited exhaustive search in discrete graphical models
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
Computing tropical linear spaces
Journal of Symbolic Computation
A survey on enhanced subspace clustering
Data Mining and Knowledge Discovery
Closed and noise-tolerant patterns in n-ary relations
Data Mining and Knowledge Discovery
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
Proceedings of the twenty-ninth annual symposium on Computational geometry
A polynomial case of the cardinality-constrained quadratic optimization problem
Journal of Global Optimization
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
An efficient construction and application usefulness of rectangle greedy covers
Pattern Recognition
| Hi-index | 0.07 |