Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Data structures and network algorithms
Data structures and network algorithms
Theoretical Computer Science
The forwarding index of communication networks
IEEE Transactions on Information Theory
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
The token distribution problem
SIAM Journal on Computing
On forwarding indices of networks
Discrete Applied Mathematics
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
The maximum concurrent flow problem
Journal of the ACM (JACM)
Ordering problems approximated: single-processor scheduling and interval graph completion
Proceedings of the 18th international colloquium on Automata, languages and programming
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Forwarding indices of k-connected graphs
Discrete Applied Mathematics - Special double volume: interconnection networks
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved bounds on the max-flow min-cut ratio for multicommodity flows
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Finding minimum-quotient cuts in planar graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
The vertex separation and search number of a graph
Information and Computation
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Approximation algorithms for Steiner and directed multicuts
Journal of Algorithms
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
A probabilistic multicommodity-flow solution to circuit clustering problems
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fast algorithms for finding O(congestion+dilation) packet routing schedules
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Multicommodity Flow and Circuit Switching
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Improved approximations of crossings in graph drawings
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximating the minimum bisection size (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Implementing Shared Memory on Clustered Machines
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for the Unsplittable Flow Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On average distortion of embedding metrics into the line and into L1
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the complexity of finding balanced oneway cuts
Information Processing Letters
Sparsest cuts and concurrent flows in product graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
The directed circular arrangement problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Circular arrangements and cyclic broadcast scheduling
Journal of Algorithms
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A decentralized algorithm for spectral analysis
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science - Latin American theorotical informatics
Crossing number, pair-crossing number, and expansion
Journal of Combinatorial Theory Series B
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for Unique Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower bounds for embeddings into L1
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Finding small balanced separators
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Integrality gaps for sparsest cut and minimum linear arrangement problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An O(√n)-approximation algorithm for directed sparsest cut
Information Processing Letters
On the max-flow min-cut ratio for directed multicommodity flows
Theoretical Computer Science
Dynamic online QoS routing schemes: performance and bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
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)
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
On conditions for constant throughput in wireless networks
ACM Transactions on Sensor Networks (TOSN)
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
Improved bounds for the unsplittable flow problem
Journal of Algorithms
The multi-multiway cut problem
Theoretical Computer Science
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The price of anarchy in network creation games
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
Algorithms and incentives for robust ranking
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Single source multiroute flows and cuts on uniform capacity networks
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A decentralized algorithm for spectral analysis
Journal of Computer and System Sciences
Finding dense and isolated submarkets in a sponsored search spending graph
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Feedback arc set problem in bipartite tournaments
Information Processing Letters
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On partitioning graphs via single commodity flows
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
Capacity regions for multiple unicast flows using inter-session network coding
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Partitioning graphs into balanced components
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Polynomial flow-cut gaps and hardness of directed cut problems
Journal of the ACM (JACM)
On the geometry of graphs with a forbidden minor
Proceedings of the forty-first annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
On the multicast throughput capacity of network coding in wireless ad-hoc networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Engineering planar separator algorithms
Journal of Experimental Algorithmics (JEA)
ACM Transactions on Computation Theory (TOCT)
Practical partition-based theorem proving for large knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Foundations and Trends® in Theoretical Computer Science
Dynamic online QoS routing schemes: Performance and bounds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bounds on the throughput gain of network coding in unicast and multicast wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
COLA: optimizing stream processing applications via graph partitioning
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Multicast throughput order of network coding in wireless ad-hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
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)
An O(n)-approximation algorithm for directed sparsest cut
Information Processing Letters
Discrete Applied Mathematics
Impact of source counter on DTN routing control under resource constraints
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Pairwise data clustering and applications
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A nondifferentiable optimization approach to ratio-cut partitioning
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Feedback arc set problem in bipartite tournaments
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
The directed circular arrangement problem
ACM Transactions on Algorithms (TALG)
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
How bad is single-path routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
COLA: optimizing stream processing applications via graph partitioning
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Network coding does not change the multicast throughput order of wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The balanced unicast and multicast capacity regions of large wireless networks
IEEE Transactions on Information Theory
Network coding: an excellent approach for overloaded communication era
WSEAS TRANSACTIONS on COMMUNICATIONS
A separator theorem for string graphs and its applications
Combinatorics, Probability and Computing
Untangling the cross-lingual link structure of Wikipedia
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Region growing for multi-route cuts
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Flow-cut gaps for integer and fractional multiflows
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Determining edge expansion and other connectivity measures of graphs of bounded genus
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Location-aided fast distributed consensus in wireless networks
IEEE Transactions on Information Theory
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
The price of anarchy in cooperative network creation games
ACM SIGecom Exchanges
Fast track article: Impact of source counter on routing performance in resource constrained DTNs
Pervasive and Mobile Computing
The complexity status of problems related to sparsest cuts
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Refining graph partitioning for social network clustering
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
An algorithm for the graph crossing number problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Near-optimal distortion bounds for embedding doubling spaces into L1
Proceedings of the forty-third annual ACM symposium on Theory of computing
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Electric routing and concurrent flow cutting
Theoretical Computer Science
Algorithmic extensions of cheeger's inequality to higher eigenvalues and partitions
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Energy saving in fixed wireless broadband networks
INOC'11 Proceedings of the 5th international conference on Network optimization
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Multicommodity flows and cuts in polymatroidal networks
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Approximation algorithms and hardness of the k-route cut problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate duality of multicommodity multiroute flows and cuts: single source case
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The generalized deadlock resolution problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Engineering planar separator algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Throughput-competitive advance reservation with bounded path dispersion
IEEE/ACM Transactions on Networking (TON)
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
Overlapping clusters for distributed computation
Proceedings of the fifth ACM international conference on Web search and data mining
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the performance of dynamic online qos routing schemes
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The set cover with pairs problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The laplacian paradigm: emerging algorithms for massive graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
The price of anarchy in network creation games
ACM Transactions on Algorithms (TALG)
Disjoint edges in topological graphs
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Approximate computation and implicit regularization for very large-scale data analysis
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On vertex sparsifiers with Steiner nodes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Many sparse cuts via higher eigenvalues
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
On cutwidth parameterized by vertex cover
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Polynomiality of sparsest cuts with fixed number of sources
Operations Research Letters
Algorithms for the universal and a priori TSP
Operations Research Letters
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
Unsupervised sparse matrix co-clustering for marketing and sales intelligence
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Cost of not splitting in routing: characterization and estimation
IEEE/ACM Transactions on Networking (TON)
Fast balanced partitioning is hard even on grids and trees
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Random Structures & Algorithms
Tradeoffs in CDN designs for throughput oriented traffic
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory Series B
Corner cuts are close to optimal: From solid grids to polygons and back
Discrete Applied Mathematics
Sparsest cut on quotients of the hypercube
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Low latency energy efficient communications in global-scale cloud computing systems
Proceedings of the 2013 workshop on Energy efficient high performance parallel and distributed computing
Sparsest cut on quotients of the hypercube
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
d-dimensional arrangement revisited
Information Processing Letters
Parallel graph decompositions using random shifts
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Journal of the ACM (JACM)
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the 2-sum embedding conjecture
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
Maximum edge-disjoint paths in k-sums of graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Pathwidth, trees, and random embeddings
Combinatorica
Exploiting small world property for network clustering
World Wide Web
High throughput data center topology design
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.15 |