Computing and Combinatorics

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Lecture Notes in Computer Science

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-32241-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Non-uniform ACC Circuit Lower Bounds

  2011cited by this paper
• Small Ramsey Numbers

  2011influential reference
• Effects of Crossing Angles

  2008influential reference
• Foundations of multidimensional and metric data structures

  2006influential reference
• The structure of claw-free graphs

  2005influential reference
• Ray shooting amid balls, farthest point from a line, and range emptiness searching

  2005influential reference
• The complexity of constructing pseudorandom generators from hard functions

  2005cited by this paper
• On uniform amplification of hardness in NP

  2005cited by this paper
• Planar Ramsey Numbers

  2005influential reference
• List-decoding using the XOR lemma

  2003cited by this paper
• Pseudorandomness and Average-Case Complexity Via Uniform Reductions

  2002cited by this paper
• Hardness amplification within NP

  2002cited by this paper
• On Constants for Cuttings in the Plane

  1998influential reference
• Some Results on Selectivity and Self-Reducibility

  1995cited by this paper
• Polynomial-time membership comparable sets

  1994cited by this paper
• On polynomial-time truth-table reducibility of intractable sets to P-selective sets

  1991cited by this paper
• Graph Classes: A Survey

  1987influential reference
• Ten lectures on the probabilistic method

  1987influential reference
• Algorithmic graph theory and perfect graphs

  1986influential reference
• The complexity of combinatorial problems with succinct input representation

  1986cited by this paper
• Separating the polynomial-time hierarchy by oracles

  1985cited by this paper
• Longest paths and cycles in K1, 3-free graphs

  1985influential reference
• Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity

  1982cited by this paper
• P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP

  1979cited by this paper
• On Ramsey Graph Numbers for Stars and Stripes

  1975influential reference
• Relativizations of the P =? NP Question

  1975cited by this paper
• Topics on tournaments

  1968cited by this paper
• AN EXTENSION OF LANDAU'S THEOREM ON TOURNAMENTS

  1963cited by this paper
• Zur Theorie der Gesellschaftsspiele

  1928cited by this paper
• On a Problem of Formal Logic

  year unknowninfluential reference

• Distributed Topological Reliability Analysis via Modular Decomposition and MPI

  2025cites this paper
• Constructing Generalized Suffix Trees on Distributed Parallel Platforms

  2023cites this paper
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together

  2023cites this paper
• Growth principles of natural hypergraphs

  2022cites this paper
• Robust transshipment problem under consistent flow constraints

  2022cites this paper
• Maximum Customers' Satisfaction in One-way Car-sharing: Modeling, Exact and Heuristic Solving

  2020cites this paper
• A Social Interaction Activity based Time-Varying User Vectorization Method for Online Social Networks

  2018cites this paper
• A liability allocation game

  2018cites this paper
• Gene tree species tree reconciliation with gene conversion

  2017cites this paper
• The Edit Distance Function of Some Graphs

  2017cites this paper
• Cograph editing: Merging modules is equivalent to editing P_4s

  2017cites this paper
• Structural analysis of high-dimensional basins of attraction.

  2016cites this paper
• Automatic molecular structure perception for the universal force field

  2016cites this paper
• Random numbers as probabilities of machine behavior

  2016cites this paper
• Energy-optimal algorithms for computing aggregative functions in random networks

  2016cites this paper
• On Robust Concepts and Small Neural Nets

  2016cites this paper
• Efficient Pattern Matching in Elastic-Degenerate Strings

  2016cites this paper
• The Probability of a Computable Output from a Random Oracle

  2016cites this paper
• Complémentarité dans les Réseaux Sociaux Complémentarité de personnes partageant des propriétés dans les Réseaux Sociaux

  2015cites this paper
• An ant colony optimization algorithm for partitioning graphs with supply and demand

  2015cites this paper
• Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks

  2015cites this paper
• On degree-degree correlations in multilayer networks

  2015cites this paper
• A survey on Succinct Representation of Graph Data

  2014cites this paper
• Quantum Google in a Complex Network

  2013cites this paper
• Prompt mechanism for online auctions with multi-unit demands

  2013cites this paper
• D S ] 17 D ec 2 01 2 Online Bin Packing with Advice ⋆

  2012cites this paper
• A Bibliography of Papers in Lecture Notes in Computer Science (2012): Volumes 7650{7699

  2012cites this paper
• A survey of recursive analysis and Moore’s notion of real computation

  2012cites this paper
• Locating a Service Facility and a Rapid Transit Line

  2011cites this paper
• Advances in intelligent and soft computing

  2011cites this paper
• Adiabatic quantum algorithm for search engine ranking.

  2011cites this paper
• A Gene Clustering Method with Hierarchical Visualization of Alignment Pairs

  2009cites this paper