SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Annals of Mathematics and Artificial Intelligence
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A Boolean measure of similarity
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Two algorithms for LCS Consecutive Suffix Alignment
Journal of Computer and System Sciences
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
Random Low Degree Polynomials are Hard to Approximate
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Pseudonyms in Cost-Sharing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Selfish Scheduling with Setup Times
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Theoretical Computer Science
On the induced matching problem
Journal of Computer and System Sciences
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
Theoretical Computer Science
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Locally consistent constraint satisfaction problems with binary constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Systems of linear equations over F2 and problems parameterized above average
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Transaction databases, frequent itemsets, and their condensed representations
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Cancellation-Free circuits in unbounded and bounded depth
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Journal of Algebraic Combinatorics: An International Journal
| Hi-index | 0.00 |
This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods.