A graph partitioning algorithm by node separators
ACM Transactions on Mathematical Software (TOMS)
Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
Average-case analysis of algorithms for matchings and related problems
Journal of the ACM (JACM)
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Communication-processor tradeoffs in limited resources PRAM
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
On Optimal Ear-Decompositions of Graphs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Schedule-Then-Break Approach to Sports Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Near-optimum Universal Graphs for Graphs with Bounded Degrees
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Decomposable trees: a polynomial algorithm for tripodes
Discrete Applied Mathematics
On contract-and-refine transformations between phylogenetic trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the Location of Roots of Independence Polynomials
Journal of Algebraic Combinatorics: An International Journal
An interactive clustering-based approach to integrating source query interfaces on the deep Web
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
Numerical decomposition of geometric constraints
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Document Clustering Using Locality Preserving Indexing
IEEE Transactions on Knowledge and Data Engineering
Statistical and computational analysis of locality preserving projection
ICML '05 Proceedings of the 22nd international conference on Machine learning
A combinatorial algorithm for weighted stable sets in bipartite graphs
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Perfect matchings in uniform hypergraphs with large minimum degree
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
On the dependence polynomial of a graph
European Journal of Combinatorics
Nonlinear adaptive distance metric learning for clustering
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Sparse universal graphs for bounded-degree graphs
Random Structures & Algorithms
Sensor-target and weapon-target pairings based on auction algorithm
MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics
Combinatorics, Probability and Computing
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Structural Identifiability in Low-Rank Matrix Factorization
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Computing Sharp 2-Factors in Claw-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On hard instances of approximate vertex cover
ACM Transactions on Algorithms (TALG)
Graph decomposition and descriptional complexity of soliton automata
Journal of Automata, Languages and Combinatorics
A graph-theoretic network security game
International Journal of Autonomous and Adaptive Communications Systems
Some Results on Fractional Graph Theory
Computational Geometry and Graph Theory
Probabilistic dyadic data analysis with local and global consistency
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
A Prioritized Collective Selection Strategy for Schema Matching across Query Interfaces
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Divide-and-conquer scheme for strictly optimal retrieval of range queries
ACM Transactions on Storage (TOS)
Reconstructing Polygons from Scanner Data
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Utilising Task-Patterns in Organisational Process Knowledge Sharing
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
Utilising Task-Patterns in Organisational Process Knowledge Sharing
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
Multi-robot plan adaptation by constrained minimal distortion feature mapping
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Scheduling intervals using independent sets in claw-free graphs
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Nonnegative Matrix Factorization on Orthogonal Subspace
Pattern Recognition Letters
Minimum-weight cycle covers and their approximability
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
A new algorithm for the maximum weighted stable set problem in claw-free graphs
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A fast, simpler algorithm for the matroid parity problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Computing sharp 2-factors in claw-free graphs
Journal of Discrete Algorithms
Diversity-multiplexing tradeoff in OFDMA systems with coherence bandwidth splitting
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal diversity-multiplexing tradeoff in OFDMA systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On distributed scheduling in wireless networks exploiting broadcast and network coding
IEEE Transactions on Communications
Excessive factorizations of bipartite multigraphs
Discrete Applied Mathematics
Discriminative codeword selection for image representation
Proceedings of the international conference on Multimedia
The 3-colour ramsey number of a 3-uniform berge cycle
Combinatorics, Probability and Computing
Distributed algorithm for a color assignment on asynchronous rings
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Correlated PLSA for image clustering
MMM'11 Proceedings of the 17th international conference on Advances in multimedia modeling - Volume Part I
Cysteine and tryptophan anomalies found when scanning all the binding sites in the Protein Data Bank
International Journal of Bioinformatics Research and Applications
Counting spanning trees in graphs using modular decomposition
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Reconstructing polygons from scanner data
Theoretical Computer Science
Tolerating correlated failures for generalized Cartesian distributions via bipartite matching
Proceedings of the 8th ACM International Conference on Computing Frontiers
Counting plane graphs: flippability and its applications
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Koszulness, Krull dimension, and other properties of graph-related algebras
Journal of Algebraic Combinatorics: An International Journal
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
Computing maximum matching in parallel on bipartite graphs: worth the effort?
Proceedings of the first workshop on Irregular applications: architectures and algorithm
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Approximation algorithms for restricted cycle covers based on cycle decompositions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Acyclic bidirected and skew-symmetric graphs: algorithms and structure
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
From a zoo to a zoology: descriptive complexity for graph polynomials
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A 1.75-approximation algorithm for unsigned translocation distance
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The generalization of dirac's theorem for hypergraphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Place semantics into context: service community discovery from the WSDL corpus
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
Polyhedral analysis and branch-and-cut for the structural analysis problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Planarizing gadgets for perfect matching do not exist
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A combinatoric interpretation of dual variables for weighted matching and f-factors
Theoretical Computer Science
Approximate weighted matching on emerging manycore and multithreaded architectures
International Journal of High Performance Computing Applications
A model for minimizing active processor time
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Sparse functional representation for large-scale service clustering
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Load-balanced AP association in multi-hop wireless mesh networks
The Journal of Supercomputing
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry: Theory and Applications
Expert Systems with Applications: An International Journal
On the cores of games arising from integer edge covering functions of graphs
Journal of Combinatorial Optimization
Hi-index | 0.01 |