SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Two Approximation Algorithms for 3-Cycle Covers
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The labeled perfect matching in bipartite graphs
Information Processing Letters
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Complexity results on restricted instances of a paint shop problem for words
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The source location problem with local 3-vertex-connectivity requirements
Discrete Applied Mathematics
NP-hard graph problems and boundary classes of graphs
Theoretical Computer Science
Exemplar Longest Common Subsequence
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the Approximation of Correlation Clustering and Consensus Clustering
Journal of Computer and System Sciences
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Scheduling with Precedence Constraints of Low Fractional Dimension
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Routing to reduce the cost of wavelength conversion
Discrete Applied Mathematics
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
On Finding Small 2-Generating Sets
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Journal of Discrete Algorithms
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Theoretical Computer Science
Journal of Discrete Algorithms
Complexity issues in color-preserving graph embeddings
Theoretical Computer Science
Inapproximability of Maximal Strip Recovery
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Complexity results on restricted instances of a paint shop problem for words
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The labeled perfect matching in bipartite graphs
Information Processing Letters
Complexity and approximation results for the connected vertex cover problem
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the approximability of comparing genomes with duplicates
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
The k-anonymity problem is hard
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
The longest haplotype reconstruction problem revisited
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Domination in geometric intersection graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parameter testing in bounded degree graphs of subexponential growth
Random Structures & Algorithms
Placing regenerators in optical networks to satisfy multiple sets of requests
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Inapproximability of maximal strip recovery: II
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics
Inapproximability of maximal strip recovery
Theoretical Computer Science
Anonymizing binary and small tables is hard to approximate
Journal of Combinatorial Optimization
Quantum Information & Computation
Finding approximate and constrained motifs in graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM)
On the complexity of the l-diversity problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fingerprint clustering with bounded number of missing values
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On approximating restricted cycle covers
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On the approximation of computing evolutionary trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the NP-Completeness of some graph cluster measures
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Correlation clustering and consensus clustering
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
New results for the Longest Haplotype Reconstruction problem
Discrete Applied Mathematics
Exemplar longest common subsequence
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Minimum-Cost broadcast through varying-size neighborcast
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Complexity insights of the minimum duplication problem
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A combinatorial model and algorithm for globally searching community structure in complex networks
Journal of Combinatorial Optimization
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Sports tournaments, home-away assignments, and the break minimization problem
Discrete Optimization
Local search for the minimum label spanning tree problem with bounded color classes
Operations Research Letters
Hardness of approximation of the discrete time-cost tradeoff problem
Operations Research Letters
NP-completeness and APX-completeness of restrained domination in graphs
Theoretical Computer Science
Inapproximability of (1,2)-exemplar distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Minimum leaf removal for reconciliation: complexity and algorithms
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
The stackelberg minimum spanning tree game
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Placing regenerators in optical networks to satisfy multiple sets of requests
IEEE/ACM Transactions on Networking (TON)
Finding approximate and constrained motifs in graphs
Theoretical Computer Science
The constrained shortest common supersequence problem
Journal of Discrete Algorithms
Parameterized complexity of k-anonymity: hardness and tractability
Journal of Combinatorial Optimization
Approximation algorithms for the joint replenishment problem with deadlines
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Guarding thin orthogonal polygons is hard
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Exact algorithms and APX-hardness results for geometric packing and covering problems
Computational Geometry: Theory and Applications
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
On defensive alliances and strong global offensive alliances
Discrete Applied Mathematics
Complexity results for rainbow matchings
Theoretical Computer Science
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
Inapproximability of (1,2)-Exemplar Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Gene tree correction for reconciliation and species tree inference: Complexity and algorithms
Journal of Discrete Algorithms
Hardness results and approximation algorithm for total liar's domination in graphs
Journal of Combinatorial Optimization
| Hi-index | 5.24 |