A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays
IEEE Transactions on Computers
On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Learnable and Nonlearnable Visual Concepts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for parallel k-vertex connectivity and sparse certificates
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Message-optimal protocols for byzantine agreement (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Embedding Classical Communication Topologies in the Scalable OPAM Architecture
IEEE Transactions on Parallel and Distributed Systems
Reconstructing a three-dimensional model with arbitrary errors
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Reconstructing a three-dimensional model with arbitrary errors
Journal of the ACM (JACM)
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the achromatic number
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximately counting Hamilton cycles in dense graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Eliminating migration in multi-processor scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Communication-time trade-offs in network synchronization
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
On approximating the achromatic number
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Independent triangles covering given vertices of a graph
Theoretical Computer Science
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Comment on Generic Universal Switch Blocks
IEEE Transactions on Computers
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
Size of k-uniform hypergraph with diameter d
Discrete Mathematics
CRYPTIM: Graphs as Tools for Symmetric Encryption
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Clique-Width of Graphs in Hereditary Classes
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Evasiveness of Subgraph Containment and Related Properties
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Power of Additive Combinatorial Search Model
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On the Number of Minimum Cuts in a Graph
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The Regularity Lemma and Its Applications in Graph Theory
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Geometric Graphs with No Self-intersecting Path of Length Three
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Monotonicity of Games Generated by Symmetric Submodular Functions
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Approximation Algorithms for the Achromatic Number
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Packing Cycles and Cuts in Undirected Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Limitations of Learning via Embeddings in Euclidean Half-Spaces
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
What Designers of Bus and Network Architectures Should Know about Hypercubes
IEEE Transactions on Computers
Topological graphs with no self-intersecting cycle of length 4
Proceedings of the nineteenth annual symposium on Computational geometry
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
Combinatorics, Probability and Computing
Local Anti-Ramsey Numbers of Graphs
Combinatorics, Probability and Computing
On the Erdös–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
Combinatorics, Probability and Computing
The Turán Theorem for Random Graphs
Combinatorics, Probability and Computing
Large Topological Cliques in Graphs Without a 4-Cycle
Combinatorics, Probability and Computing
Packing Trees into the Complete Graph
Combinatorics, Probability and Computing
Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
Combinatorics, Probability and Computing
The Chromatic Number of Graph Powers
Combinatorics, Probability and Computing
On the Edge Distribution of a Graph
Combinatorics, Probability and Computing
Spanning Trees in Dense Graphs
Combinatorics, Probability and Computing
On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
Combinatorics, Probability and Computing
Some Inequalities for the Largest Eigenvalue of a Graph
Combinatorics, Probability and Computing
Dominating a Family of Graphs with Small Connected Subgraphs
Combinatorics, Probability and Computing
Critical Exponents, Colines, and Projective Geometries
Combinatorics, Probability and Computing
Critical Exponents, Colines, and Projective Geometries
Combinatorics, Probability and Computing
The Minimum Size of Saturated Hypergraphs
Combinatorics, Probability and Computing
Hypergraph Packing and Graph Embedding
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
Combinatorics, Probability and Computing
Distant Vertex Partitions of Graphs
Combinatorics, Probability and Computing
A Remark on the Number of Complete and Empty Subgraphs
Combinatorics, Probability and Computing
Triangle-Free Graphs with Large Degree
Combinatorics, Probability and Computing
Maximal Spacing Configurations in Graphs
Combinatorics, Probability and Computing
Independent Transversals and Independent Coverings in Sparse Partite Graphs
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
On locally Delaunay geometric graphs
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Families of Trees Decompose the Random Graph in an Arbitrary Way
Combinatorics, Probability and Computing
A variation of a classical Turán-type extremal problem
European Journal of Combinatorics
Stability theorems for cancellative hypergraphs
Journal of Combinatorial Theory Series B
Broadcast time and connectivity
Discrete Applied Mathematics
Geometric graphs with no self-intersecting path of length three
European Journal of Combinatorics - Special issue: Topological graph theory
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Packings in Dense Regular Graphs
Combinatorics, Probability and Computing
Triple Systems Not Containing a Fano Configuration
Combinatorics, Probability and Computing
Approximating k-spanner problems for k 2
Theoretical Computer Science
Shifted products that are coprime pure powers
Journal of Combinatorial Theory Series A
On Two Conjectures on Packing of Graphs
Combinatorics, Probability and Computing
On Triple Systems with Independent Neighbourhoods
Combinatorics, Probability and Computing
Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions
Journal of Combinatorial Theory Series B
Combinatorics, Probability and Computing
Hierarchical topological network design
IEEE/ACM Transactions on Networking (TON)
Asymptotically large (Δ, D)-graphs
Discrete Applied Mathematics
Extremal connectivity for topological cliques in bipartite graphs
Journal of Combinatorial Theory Series B
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Large planar subgraphs in dense graphs
Journal of Combinatorial Theory Series B
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Journal of Combinatorial Theory Series A
Efficient approximation algorithms for the achromatic number
Theoretical Computer Science - Approximation and online algorithms
Edge Distribution of Graphs with Few Copies of a Given Graph
Combinatorics, Probability and Computing
Strong Rabin numbers of folded hypercubes
Theoretical Computer Science
On the diameter of separated point sets with many nearly equal distances
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Improved lower bounds on the randomized complexity of graph properties
Random Structures & Algorithms
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms (TALG)
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
Discrete Applied Mathematics
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
Combinatorics, Probability and Computing
Large Graphs with Given Degree and Diameter Part I
IEEE Transactions on Computers
Study of algorithms on machines through graphs II
ROCOM'07 Proceedings of the 7th WSEAS International Conference on Robotics, Control & Manufacturing Technology
CSV: visualizing and mining cohesive subgraphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
On the minimal density of triangles in graphs
Combinatorics, Probability and Computing
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Journal of Combinatorial Theory Series A
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
New results for finding common neighborhoods in massive graphs in the data stream model
Theoretical Computer Science
Calculating the extremal number ex(v;{C3,C4,...,Cn})
Discrete Applied Mathematics
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs
Theoretical Computer Science
Hardness of edge-modification problems
Theoretical Computer Science
One-to-many node-disjoint paths in (n,k)-star graphs
Discrete Applied Mathematics
Logical queries over views: Decidability and expressiveness
ACM Transactions on Computational Logic (TOCL)
On Matrix Representations of Participation Constraints
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Isoperimetric inequalities and the width parameters of graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Graph coloring and the immersion order
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A network creation game with nonuniform interests
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Efficient approximation algorithms for shortest cycles in undirected graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes
IEEE Transactions on Information Theory
Universal rigidity: towards accurate and efficient localization of wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A lower bound for the spectral radius of graphs with fixed diameter
European Journal of Combinatorics
Information Sciences: an International Journal
Characterization of minimally (2,l)-connected graphs
Information Processing Letters
Arboricity, h-index, and dynamic algorithms
Theoretical Computer Science
Long cycles in subgraphs of (pseudo)random directed graphs
Journal of Graph Theory
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
ACM Transactions on Algorithms (TALG)
FPT algorithms for domination in biclique-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.08 |