Journal of Algorithms
SIAM Journal on Computing
Journal of the ACM (JACM)
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On approximating a vertex cover for planar graphs
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Algorithms on trees and maximal outerplanar graphs: design, complexity analysis, and data structures study.
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A polynomial-time approximation scheme for weighted planar graph TSP
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On local search and placement of meters in networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Coloring powers of planar graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Private approximation of NP-hard functions
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Information and Computation
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Exploiting structure in quantified formulas
Journal of Algorithms
Packing triangles in bounded degree graphs
Information Processing Letters
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Parameterized Algorithms for Planar Dominating Set
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Computing the Girth of a Planar Graph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Illuminating Both Sides of Line Segments
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Bounded-Degree Independent Sets in Planar Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for Independent Sets in Map Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the Parameterized Complexity of Layered Graph Drawing
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Packing Cycles and Cuts in Undirected Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximation algorithms for aligning points
Proceedings of the nineteenth annual symposium on Computational geometry
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
Journal of Discrete Algorithms
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Approximation algorithms for partial covering problems
Journal of Algorithms
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximating vertex cover on dense graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A refined search tree technique for Dominating Set on planar graphs
Journal of Computer and System Sciences
Degree-constrained decompositions of graphs: bounded treewidth and planarity
Theoretical Computer Science
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Theoretical Computer Science
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Invitation to data reduction and problem kernelization
ACM SIGACT News
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Single machine precedence constrained scheduling is a vertex cover problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Traversing the machining graph
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Digraph measures: Kelly decompositions, games, and orderings
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the spanning star forest problem and its applications to genomic sequence alignment
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Constructing battery-aware virtual backbones in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Computational Geometry: Theory and Applications
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
Batch Coloring Flat Graphs and Thin
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Computational Study on Dominating Set Problem of Planar Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximation Algorithms and Hardness for Domination with Propagation
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Quantum Information Processing
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
Introduction to the Maximum Solution Problem
Complexity of Constraints
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
Approximation and Online Algorithms
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Note: A simple algorithm for multicuts in planar graphs with outer terminals
Discrete Applied Mathematics
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Randomly removing g handles at once
Proceedings of the twenty-fifth annual symposium on Computational geometry
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An optimal local approximation algorithm for max-min linear programs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Large independent sets in random regular graphs
Theoretical Computer Science
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Computational study on planar dominating set problem
Theoretical Computer Science
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
Journal of Discrete Algorithms
Optimization for first order Delaunay triangulations
Computational Geometry: Theory and Applications
Covering a Graph with a Constrained Forest (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Non-cooperative facility location and covering games
Theoretical Computer Science
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Genus characterizes the complexity of graph problems: some tight results
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Cost minimisation in multi-interface networks
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Approximation algorithms for geometric intersection graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
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
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Determining the smallest k such that G is k-outerplanar
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimization and recognition for K5-minor free graphs in linear time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Domination in geometric intersection graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Randomly removing g handles at once
Computational Geometry: Theory and Applications
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Parameter testing in bounded degree graphs of subexponential growth
Random Structures & Algorithms
A metric for rooted trees with unlabeled vertices based on nested parentheses
Theoretical Computer Science
Improved induced matchings in sparse graphs
Discrete Applied Mathematics
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Polynomial time approximation schemes for minimum disk cover problems
Journal of Combinatorial Optimization
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete 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
Approximation algorithms for the capacitated domination problem
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast minor testing in planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
The train delivery problem: vehicle routing meets bin packing
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
On approximating the d-girth of a graph
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications
SIAM Journal on Discrete Mathematics
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Information Processing Letters
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the performance of TCP over throughput-optimal CSMA
Proceedings of the Nineteenth International Workshop on Quality of Service
Complexity and approximation of the Constrained Forest problem
Theoretical Computer Science
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Quantum Information & Computation
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Guard games on graphs: Keep the intruder out!
Theoretical Computer Science
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization
Selfish service installation in networks
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A polynomial-time approximation scheme for planar multiway cut
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A PTAS for the minimum dominating set problem in unit disk graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
Algorithms for finding distance-edge-colorings of graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the hardness of range assignment problems
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Approximation algorithms for unit disk graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Minimum sum multicoloring on the edges of planar graphs and partial k-trees
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Poly-APX- and PTAS-Completeness in standard and differential approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ACM Transactions on Algorithms (TALG)
Algorithms for graphs embeddable with few crossings per edge
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A robust PTAS for maximum weight independent sets in unit disk graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Dynamic graph-based search in unknown environments
Journal of Discrete Algorithms
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Extension of the nemhauser and trotter theorem to generalized vertex cover with applications
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Guard games on graphs: keep the intruder out!
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
Small point sets for simply-nested planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Capacitated domination: constant factor approximations for planar graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Combinatorial auctions with restricted complements
Proceedings of the 13th ACM Conference on Electronic Commerce
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Linear-Time computation of a linear problem kernel for dominating set on planar graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Operations Research Letters
Survey: A survey on the structure of approximation classes
Computer Science Review
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The robust set problem: parameterized complexity and approximation
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Uncover low degree vertices and minimise the mess: independent sets in random regular graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Linear problem kernels for NP-hard problems on planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Optimization for first order delaunay triangulations
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Computing a minimum-depth planar graph embedding in O(n4) time
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
PTAS for the minimum weighted dominating set in growth bounded graphs
Journal of Global Optimization
On the complexity of metric dimension
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Placing regenerators in optical networks to satisfy multiple sets of requests
IEEE/ACM Transactions on Networking (TON)
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization
Constant-factor approximation of the domination number in sparse graphs
European Journal of Combinatorics
Product-state approximations to quantum ground states
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A note on the complexity of matching patterns with variables
Information Processing Letters
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
On approximating the d-girth of a graph
Discrete Applied Mathematics
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
| Hi-index | 0.02 |