Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Arboricity and subgraph listing algorithms
SIAM Journal on Computing
Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
The NP-completeness column: an ongoing guide
Journal of Algorithms
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Finding minimally weighted subgraphs
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On linear time minor tests with depth-first search
Journal of Algorithms
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Smallest-last ordering and clustering and graph coloring algorithms
Journal of the ACM (JACM)
On Approximating the Longest Path in a Graph (Preliminary Version)
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Finding Even Cycles Even Faster
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallel subgraph matching on a hierarchical interconnection network
Hardware implementation of intelligent systems
Computing the Girth of a Planar Graph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Finding a Path of Superlogarithmic Length
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Threshold Ring Signatures and Applications to Ad-hoc Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Computing small partial coverings
Information Processing Letters
Detecting directed 4-cycles still faster
Information Processing Letters
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for finding long paths in Hamiltonian graphs
Journal of Algorithms - Special issue: SODA 2000
Finding paths and cycles of superpolylogarithmic length
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A faster parameterized algorithm for set packing
Information Processing Letters
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding a maximum weight triangle in n3-Δ time, with applications
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Theoretical Computer Science - Parameterized and exact computation
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
A Column-Generation Approach to Line Planning in Public Transport
Transportation Science
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding a heaviest triangle is not harder than matrix multiplication
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Open problems around exact algorithms
Discrete Applied Mathematics
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Partial vs. Complete Domination: t-Dominating Set
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Improved Parameterized Algorithms for Weighted 3-Set Packing
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Approximately Counting Embeddings into Random Graphs
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
The complexity of nonrepetitive coloring
Discrete Applied Mathematics
Efficient algorithms for clique problems
Information Processing Letters
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Finding paths of length k in O∗(2k) time
Information Processing Letters
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
Approximating the Number of Network Motifs
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
The ExemplarBreakpointDistance for Non-trivial Genomes Cannot Be Approximated
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Efficient approximation algorithms for shortest cycles in undirected graphs
Information Processing Letters
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Querying Protein-Protein Interaction Networks
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Topology-Free Querying of Protein Interaction Networks
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Maximum Motif Problem in Vertex-Colored Graphs
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computing the Girth of a Planar Graph in O(n logn) Time
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
The Budgeted Unique Coverage Problem and Color-Coding
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On problems without polynomial kernels
Journal of Computer and System Sciences
Networks of polynomial pieces with application to the analysis of point clouds and images
Journal of Approximation Theory
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
A faster parameterized algorithm for set packing
Information Processing Letters
QNet: a tool for querying protein interaction networks
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Parameterized algorithms for weighted matching and packing problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
The longest haplotype reconstruction problem revisited
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Randomized disposal of unknowns and implicitly enforced bounds on parameters
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Efficient approximation algorithms for shortest cycles in undirected graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Balanced families of perfect hash functions and their applications
ACM Transactions on Algorithms (TALG)
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
Journal of Computer and System Sciences
Annotating fragmentation patterns
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Quantifying systemic evolutionary changes by color coding confidence-scored PPI networks
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
An automated signature generation approach for polymorphic worm based on color coding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Finding monotone paths in edge-ordered graphs
Discrete Applied Mathematics
Variants of constrained longest common subsequence
Information Processing Letters
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Counting stars and other small subgraphs in sublinear time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Finding and counting vertex-colored subtrees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The curse of connectivity: t-total vertex (edge) cover
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Efficient enumeration for conjunctive queries over x-underbar structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved approximation bounds for the minimum rainbow subgraph problem
Information Processing Letters
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms
Complexity issues for the sandwich homogeneous set problem
Discrete Applied Mathematics
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem
Theoretical Computer Science
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Computing the Girth of a Planar Graph in $O(n \logn)$ Time
SIAM Journal on Discrete Mathematics
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Journal of Combinatorial Theory Series B
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Parameterized complexity of even/odd subgraph problems
Journal of Discrete Algorithms
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Finding approximate and constrained motifs in graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues
INFORMS Journal on Computing
Unique small subgraphs are not easier to find
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Clustering with local restrictions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A shortest cycle for each vertex of a graph
Information Processing Letters
Externalities among advertisers in sponsored search
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching
ACM Transactions on Algorithms (TALG)
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Subquadratic time approximation algorithms for the girth
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast FPT-Algorithms for cleaning grids
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
An (n - t)-out-of-n threshold ring signature scheme
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Searching paths of constant bandwidth
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Counting and detecting small subgraphs via equations and matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Kernel and fast algorithm for dense triplet inconsistency
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Topology aware coloring of gene regulatory networks
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Efficient algorithms for detecting signaling pathways in protein interaction networks
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences
Comparative analysis of protein networks: hard problems, practical solutions
Communications of the ACM
Greedy localization and color-coding: improved matching and packing algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On the effective enumerability of NP problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
New results for the Longest Haplotype Reconstruction problem
Discrete Applied Mathematics
Parameterized problems on coincidence graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Parameterized complexity of even/odd subgraph problems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Symmetry matters for the sizes of extended formulations
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for path and cycle problems
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
Discrete Optimization
Stable assignment with couples: Parameterized complexity and local search
Discrete Optimization
Paths of bounded length and their cuts: Parameterized complexity and algorithms
Discrete Optimization
Parameterized algorithms for weighted matching and packing problems
Discrete Optimization
Finding Cycles with Topological Properties in Embedded Graphs
SIAM Journal on Discrete Mathematics
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Fixed-parameter tractability of satisfying beyond the number of variables
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap
IEEE/ACM Transactions on Networking (TON)
QSEA for fuzzy subgraph querying of KEGG pathways
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Can crowdsensing beat dynamic cell-ID?
Proceedings of the Third International Workshop on Sensing Applications on Mobile Phones
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Balanced families of perfect hash functions and their applications
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A randomized approximation algorithm for parameterized 3-D matching counting problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Completely inapproximable monotone and antimonotone parameterized problems
Journal of Computer and System Sciences
Span programs and quantum algorithms for st-connectivity and claw detection
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Parameterized complexity of induced h-matching on claw-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Restricted and swap common superstring: a parameterized view
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Finding dense subgraphs of sparse graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Clustering with local restrictions
Information and Computation
Parameterized top-K algorithms
Theoretical Computer Science
On the parameterized complexity of finding separators with non-hereditary properties
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
ACM Transactions on Algorithms (TALG)
Quasi-hamiltonian paths in semicomplete multipartite digraphs
Discrete Applied Mathematics
Enumeration of first-order queries on classes of structures with bounded expansion
Proceedings of the 32nd symposium on Principles of database systems
Finding approximate and constrained motifs in graphs
Theoretical Computer Science
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science
Color distribution can accelerate network alignment
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
RANGI: A Fast List-Colored Graph Motif Finding Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Exact weight subgraphs and the k-sum conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Large neighborhood local search for the maximum set packing problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Finding the minimum-weight k-path
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Parameterized complexity of connected even/odd subgraph problems
Journal of Computer and System Sciences
A faster FPT algorithm for Bipartite Contraction
Information Processing Letters
Proceedings of the 5th conference on Innovations in theoretical computer science
Parameterized maximum path coloring
Theoretical Computer Science
Kernel bounds for path and cycle problems
Theoretical Computer Science
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
The density maximization problem in graphs
Journal of Combinatorial Optimization
An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.03 |