Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms
Journal of Experimental Algorithmics (JEA)
Bipartite graphs without a skew star
Discrete Mathematics
On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
The Engineering of Some Bipartite Matching Programs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
The Engineering of some Bipartite Matching Programs
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Selected topics on assignment problems
Discrete Applied Mathematics
Sweep synchronization as a global propagation mechanism
Computers and Operations Research
On uniform k-partition problems
Discrete Applied Mathematics - Special issue: Max-algebra
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
Perfect matchings and extended polymatroid
Cybernetics and Systems Analysis
Minimum Leaf Out-Branching Problems
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Generalised arc consistency for the AllDifferent constraint: An empirical survey
Artificial Intelligence
Minimum leaf out-branching and related problems
Theoretical Computer Science
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
On uniform k-partition problems
Discrete Applied Mathematics
Formal analysis and algorithms for extracting coordinate systems of games
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
Scheduling research grant proposal evaluation meetings and the range colouring problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
The balanced traveling salesmanproblem
Computers and Operations Research
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
Finding all maximally-matchable edges in a bipartite graph
Theoretical Computer Science
Persistency in maximum cardinality bipartite matchings
Operations Research Letters
Semantic context dissemination and service matchmaking in future network management
International Journal of Network Management
Subset quadratic assignment problem
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Decomposing DAGs into disjoint chains
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Push-relabel based algorithms for the maximum transversal problem
Computers and Operations Research
Parameterized complexity of k-anonymity: hardness and tractability
Journal of Combinatorial Optimization
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |