The complexity of colouring problems on dense graphs
Theoretical Computer Science
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of multiway cuts (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the greedy algorithm for satisfiability
Information Processing Letters
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomness in interactive proofs
Computational Complexity
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
An improved approximation algorithm for multiway cut
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Recovering branches on the tree of life: an approximation algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Clustering for edge-cost minimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On point covers of c-oriented polygons
Theoretical Computer Science
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
On the closest string and substring problems
Journal of the ACM (JACM)
Information and Computation
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity of finding dense subgraphs
Discrete Applied Mathematics
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-Bisection of Chordal Rings
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Maximum dispersion and geometric maximum weight cliques
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
DS '99 Proceedings of the Second International Conference on Discovery Science
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Property testing in massive graphs
Handbook of massive data sets
Integer and fractional packings in dense 3-uniform hypergraphs
Random Structures & Algorithms
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Journal of the ACM (JACM)
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A New Conceptual Clustering Framework
Machine Learning
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Approximate and dynamic rank aggregation
Theoretical Computer Science - Special papers from: COCOON 2003
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The method of extremal structure on the k-maximum cut problem
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Integer and fractional packings of hypergraphs
Journal of Combinatorial Theory Series B
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
Hardness of fully dense problems
Information and Computation
Yet another algorithm for dense max cut: go greedy
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
Proceedings of the forty-first annual ACM symposium on Theory of computing
Balanced cut approximation in random geometric graphs
Theoretical Computer Science
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms (TALG)
Foundations and Trends® in Theoretical Computer Science
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
An efficient algorithm for enumerating pseudo cliques
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
Near optimal solutions for maximum quasi-bicliques
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A new Lagrangian net algorithm for solving max-bisection problems
Journal of Computational and Applied Mathematics
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Approximation schemes for the betweenness problem in tournaments and related ranking problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Approximation algorithms for bi-clustering problems
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Linear-time enumeration of isolated cliques
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating integer quadratic programs and MAXCUT in subdense graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A cut-based heuristic to produce almost feasible periodic railway timetables
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Testability of minimum balanced multiway cut densities
Discrete Applied Mathematics
Balanced cut approximation in random geometric graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Maximum dispersion problem in dense graphs
Operations Research Letters
Constant-Time approximation algorithms for the knapsack problem
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
Don't be SCAREd: use SCalable Automatic REpairing with maximal likelihood and bounded changes
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
Mathematics of Operations Research
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |