Random sampling of large planar maps and convex polyhedra
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Enumeration of 2-(9, 3, λ) Designs and Their Resolutions
Designs, Codes and Cryptography
Efficient generation of plane trees
Information Processing Letters
Note: a new lower bound for the football pool problem for six matches
Journal of Combinatorial Theory Series A
Pruning by Isomorphism in Branch-and-Cut
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Efficient Generation of Plane Triangulations without Repetitions
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Enumerating Floorplans with n Rooms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient Generation of Triconnected Plane Triangulations
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
An inductive definition of cubic toroidal maps
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
A constructive enumeration of fusenes and benzenoids
Journal of Algorithms
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8
Combinatorics, Probability and Computing
Efficient generation of triconnected plane triangulations
Computational Geometry: Theory and Applications
Dynamical Robustness in Gene Regulatory Networks
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Efficient exhaustive listings of reversible one dimensional cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
A Computer-Assisted Proof of the Uniqueness of the Perkel Graph
Designs, Codes and Cryptography
New Results on Codes with Covering Radius 1 and Minimum Distance 2
Designs, Codes and Cryptography
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Characteristic-independence of Betti numbers of graph ideals
Journal of Combinatorial Theory Series A
Equivalence-free exhaustive generation of matroid representations
Discrete Applied Mathematics
On the binary projective codes with dimension 6
Discrete Applied Mathematics
The Steiner quadruple systems of order 16
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Generating effective symmetry-breaking predicates for search problems
Discrete Applied Mathematics
Journal of Combinatorial Theory Series B
Recursive Generation of 5-Regular Planar Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
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
The number of pessimistic guesses in Generalized Mastermind
Information Processing Letters
Constant Time Generation of Integer Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Enumeration of parallel manipulators
Robotica
Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
INFORMS Journal on Computing
Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
European Journal of Combinatorics
The perfect binary one-error-correcting codes of length 15: part I-classification
IEEE Transactions on Information Theory
Equivalence-free exhaustive generation of matroid representations
Discrete Applied Mathematics
An Isomorph-Free SEM-Like Enumeration of Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Network motif discovery using subgraph enumeration and symmetry-breaking
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Isometries and construction of permutation arrays
IEEE Transactions on Information Theory
Classification of binary constant weight codes
IEEE Transactions on Information Theory
Constant time generation of biconnected rooted plane graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Counting of moore families for n=7
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
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
Constant time generation of linear extensions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On searching for small kochen-specker vector systems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
EgoNav: exploring networks through egocentric spatializations
Proceedings of the International Working Conference on Advanced Visual Interfaces
The number of pessimistic guesses in Generalized Black-peg Mastermind
Information Processing Letters
Symmetric ILP: Coloring and small integers
Discrete Optimization
Communication: House of Graphs: A database of interesting graphs
Discrete Applied Mathematics
Symmetry Compression Method for Discovering Network Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Generation of various classes of trivalent graphs
Theoretical Computer Science
Automated generation of conjectures on forbidden subgraph characterization
Discrete Applied Mathematics
On the minimum size of 4-uniform hypergraphs without property B
Discrete Applied Mathematics
G-Tries: a data structure for storing and finding subgraphs
Data Mining and Knowledge Discovery
| Hi-index | 0.18 |