yusuke1997/dblp-id-title huggingface dataset:
Extremal problems on set systems
Subgraph statistics in subcritical graph classes
Subcritical monotone cellular automata
Spherically symmetric random permutations
Some typical properties of large AND/OR Boolean formulas
Clairvoyant embedding in one dimension
Cycles with many chords
SIR epidemics on random graphs with a fixed degree sequence
Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
Interference percolation
Extremal results on feedback arc sets in digraphs
Stochastic service systems, random interval graphs and search algorithms
Chasing robbers on random graphs: Zigzag theorem
Arboricity and spanning-tree packing in random graphs
A percolating hard sphere model
Random disease on the square grid
Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
Invertibility of symmetric random matrices
Square percolation and the threshold for quadratic divergence in random right-angled Coxeter groups
Deterministic random walks on finite graphs
Swendsen-Wang algorithm on the mean-field Potts model
Random walks on the torus with several generators
Degenerate random environments
Finding a Hamilton cycle fast on average using rotations and extensions
On the probabilistic degree of OR over the reals
Random Graphs with Monochromatic Triangles in Every Edge Coloring
The geometry of logconcave functions and sampling algorithms
A large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph
A randomized on-line algorithm for the k -server problem on a line
Packing hamilton cycles in random and pseudo-random hypergraphs
A Ramsey-Turán theory for tilings in graphs
Long paths and connectivity in 1-independent random graphs
Three-query PCPs with perfect completeness over non-Boolean domains
The phase transition in the cluster-scaled model of a random graph
Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices
An almost-bijective proof of an asymptotic property of partitions
The devil's staircase for chip-firing on random graphs and on graphons
The Swendsen-Wang dynamics on trees
Characterizing optimal sampling of binary contingency tables via the configuration model
On Bollobás-Riordan random pairing model of preferential attachment graph
Long cycle of random permutations with polynomially growing cycle weights
A phase transition phenomenon in a random directed acyclic graph
On the Number of Subtrees for Almost All Graphs
On the rank, Kernel, and core of sparse random graphs
Seymour's second neighbourhood conjecture: random graphs and reductions
The size Ramsey number of short subdivisions of bounded degree graphs
Computing in fault tolerant broadcast networks and noisy decision trees
Randomized metarounding
Local uniformity properties for glauber dynamics on graph colorings
Fractional Products of Sets
Spread-out percolation in R d
Limiting probabilities of first order properties of random sparse graphs and hypergraphs
Discrepancy properties for random regular digraphs
Correlations on the Strata of a Random Mapping
On the complexity of branch-and-bound search for random trees
Expansion of random 0/1 polytopes
Spanning Maximal Planar Subgraphs of Random Graphs
Phase transitions for random structures and algorithms
Essential edges in Poisson random hypergraphs
2+p-SAT: Relation of typical-case complexity to the nature of the phase transition
Self-avoiding walk on the hypercube
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions
On the Discrepancy of 3 Permutations
Node profiles of symmetric digital search trees: Concentration properties
Random geometric subdivisions
The combinatorics of the colliding bullets
A note on dispersing particles on a line
Algorithmic Chernoff-Hoeffding inequalities in integer programming
Comment on "Volumes spanned by random points in the hypercube"
On the Structure of Random Plane-oriented Recursive Trees and Their Branches
Systems of functional equations
Sampling from the low temperature Potts model through a Markov chain on flows
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs
Biased random k-SAT
Mixing time of PageRank surfers on sparse random digraphs
A Note on Bipartite Subgraphs of Triangle-Free Graphs
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis
Balanced Ordered Trees
A more rapidly mixing Markov chain for graph colorings
The degree sequence of a scale-free random graph process
Rainbow Hamilton cycles in random geometric graphs
Perfect matchings in random uniform hypergraphs
Maximum itting Time for Random Walks on Graphs
An approximation algorithm for counting contingency tables
Community modulated recursive trees and population dependent branching processes
Improved Boolean Formulas for the Ramsey Graphs
Stratified random walks on the n-cube
The diameter of a long-range percolation graph
Topological properties of the one dimensional exponential random geometric graph
Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models
Asymptotic Packing via a Branching Process
Minors of a random binary matroid
Explicit sparse almost-universal graphs for G(n, k/n)
The continuum random tree is the scaling limit of unlabeled unrooted trees
Testing for forbidden order patterns in an array
Testing monotonicity over graph products
Random subgraphs of finite graphs: I. The scaling window under the triangle condition
The complexity of counting graph homomorphisms
Galton-Watson games
On the threshold for the Maker-Breaker H -game
Comparison of Swendsen-Wang and heat-bath dynamics
Identifying several biased coins encountered by a hidden random walk
The Wiener Index of simply generated random trees
Limit distribution of the number of consecutive records
Clustering and percolation on superpositions of Bernoulli random graphs
Seeded graph matching via large neighborhood statistics
Phase transitions for random walk asymptotics on free products of groups
Fast uniform generation of random graphs with given degree sequences
Size and path length of Patricia tries: Dynamical sources context
Counting orientations of random graphs with no directed k -cycles
An average case analysis of the minimum spanning tree heuristic for the power assignment problem
Sharpness of the phase transition for parking on random trees
The discrepancy of random rectangular matrices
Random graphs containing few disjoint excluded minors
An Algorithmic Approach to the Lovász Local Lemma. I
Cycle lengths in sparse random graphs
Analysis of Hoare's FIND algorithm with Median-of-three partition
Addendum to avoiding a giant component
Delaying satisfiability for random 2SAT
Braess's paradox in expanders
Balls and bins: A study in negative dependence
The rank of random graphs
A note on the quicksort asymptotics
A universal result for consecutive random subdivision of polygons
Martingales and large deviations for binary search trees
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph
Phase transition of the minimum degree random multigraph process
Continuous and discontinuous phase transitions in hypergraph processes
Fractional clique decompositions of dense graphs
Counting Boundary Paths for Oriented Percolation Clusters
Efficiently navigating a random Delaunay triangulation
Finding cycles and trees in sublinear time
The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs
Generalized PageRank on directed configuration networks
Sandwiching a densest subgraph by consecutive cores
Average case analysis of the Boyer-Moore algorithm
Is constraint satisfaction over two variables always easy?
Clique percolation
Estimates for Distributions of the Voronoi Polygon's Geometric Characteristics
Perfect Matchings in Random s-Uniform Hypergraphs
Some bounds on the coupon collector problem
Deviation inequality for monotonic Boolean functions with application to the number of k-cycles in a random graph
On a problem of M. Talagrand
Left and right convergence of graphs with bounded degree
Canonical Labeling of Latin Squares in Average-Case Polynomial Time
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
Counting strongly connected (k1, k2)-directed cores
Record-dependent measures on the symmetric groups
Long Range Percolation in Stationary Point Processes
The Brownian plane with minimal neck baby universe
Independence numbers of locally sparse graphs and a Ramsey type problem
Eigenvectors of random graphs: Nodal Domains
Conditional negative association for competing urns
Brownian Bridge Asymptotics for Random Mappings
Limit distribution of the coefficients of polynomials with only unit roots
Directed graphs, Hamiltonicity and doubly stochastic matrices
Diameter in ultra-small scale-free random graphs
Almost All Regular Graphs Are Hamiltonian
1-Factorizations of random regular graphs
A note on applications of the martingale central limit theorem to random permutations
Universality in two-dimensional enhancement percolation
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
Turánnical hypergraphs
Ramsey games with giants
The capacity of majority rule
Random Sparse Unary Predicates
Rumor spreading in random evolving graphs
Recoverable values for independent sets
Psi-series method for equality of random trees and quadratic convolution recurrences
Complete Partite subgraphs in dense hypergraphs
The writhe of permutations and random framed knots
Rumor spreading on random regular graphs and expanders
Continuum limits for classical sequential growth models
Bounded Branching Process AND/OR Tree Evaluation
Growth of components in random graphs
Covering random graphs with monochromatic trees
The phase transition in the uniformly grown random graph has infinite order
New methods to bound the critical probability in fractal percolation
The mixing time of the giant component of a random graph
Coloring rules for finite trees, and probabilities of monadic second order sentences
Refined quicksort asymptotics
Graphon convergence of random cographs
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
The chromatic numbers of random hypergraphs
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments
Stochastic analysis of the Merge-Sort algorithm
On Uncrowded Hypergraphs
Hunting for sharp thresholds
Hamilton Cycles in a Random Tournament
Upper Bounds for Linear Graph Codes
On the Impossibility of Amplifying the Independence of Random Variables
Connectivity graph-codes
A branching process approach to level-k phylogenetic networks
Some conditional correlation inequalities for percolation and related processes
A Random Tree Model Associated with Random Graphs
Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes
The Instability Time Distribution Behavior of Slotted ALOHA
Integer and fractional packings in dense 3-uniform hypergraphs
Asymptotic random graph intuition for the biased connectivity game
The typical structure of graphs without given excluded subgraphs
The General Birthday Problem
On Rainbow Turán Densities of Trees
Coloring triangle-free graphs with local list sizes
The probability of avoiding consecutive patterns in the Mallows distribution
On polynomial approximations to AC
Finitary codings for gradient models and a new graphical representation for the six-vertex model
Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
The phase transition in random graphs: A simple proof
Local resilience of almost spanning trees in random graphs
Counting dense connected hypergraphs via the probabilistic method
Connection Reliabilities in Stochastic Acyclic Networks
The Janson inequalities for general up-sets
Random points in halfspheres
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
Longest and shortest cycles in random planar graphs
Large deviations for sums of partly dependent random variables
Asymptotic Properties of Labeled Connected Graphs
Regularity inheritance in pseudorandom graphs
Scrambling permutations and entropy of hypergraphs
Hitting time of large subsets of the hypercube
Inside the clustering window for random linear equations
On Classification in Presence of Measurement Errors
Quasi-Random 2-Colorings of Point Sets
The probability of connectivity in a hyperbolic model of complex networks
On the multiplicity of parts in a random partition
On-line balancing of random inputs
On covering by translates of a set
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow
Asymptotics in percolation on high-girth expanders
Saturation in random graphs
Concentration and regularization of random graphs
Upper triangular matrix walk: Cutoff for finitely many columns
Convergence in Homogeneous Random Graphs
The largest tree in certain models of random forests
Improved algorithms for the random cluster graph model
A simple solution to the k -core problem
On a random graph with immigrating vertices: Emergence of the giant component
The random k-matching-free process
A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs
Generating random graphs in biased Maker-Breaker games
Coalescing times for IID random variables with applications to population biology
A sprouting tree model for random boolean functions
Monochromatic cycle covers in random graphs
Multiple cover time
On Sequences With Exponentially Distributed Gaps
On the variance of the random sphere of influence graph
Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs
A note on random greedy coloring of uniform hypergraphs
The Effect of Random Restrictions on Formula Size
Minors in graphs of large girth
Radius and Diameter of Random Subgraphs of the Hypercube
A concentration result with application to subgraph count
Pattern-avoiding permutations and Brownian excursion part I: Shapes and fluctuations
The String Chromatic Number of a Graph
Simplicial complexes: Spectrum, homology and random walks
New versions of Suen's correlation inequality
Turán's theorem in sparse random graphs
Successive shortest paths in complete graphs with random edge weights
Entropy and set cardinality inequalities for partition-determined functions
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
The Acyclic Orientation Game on Random Graphs
Graph diameter in long-range percolation
First order limits of sparse graphs: Plane trees and path-width
Hamiltonicity of graphs perturbed by a random regular graph
Bootstrap percolation on the random regular graph
The Number of Spanning Trees in Graphs with Given Degree Sequence
Representations of Integers as the Sum of k Terms
Properly coloured copies and rainbow copies of large graphs with small maximum degree
On the normality of giant components
Random walks and an O * (n 5 ) volume algorithm for convex bodies
The diameter game
Random regular graphs of high degree
The degree sequences and spectra of scale-free random graphs
Tree decomposition of graphs
On a universal best choice algorithm for partially ordered sets
Fibonacci solitaire
Universality of random graphs and rainbow embedding
Hamilton cycles in quasirandom hypergraphs
Asymptotic normality in random graphs with given vertex degrees
Phase transition for the volume of high-dimensional random polytopes
The graph structure of a deterministic automaton chosen at random
On rigidity, orientability, and cores of random graphs with sliders
The diameter of a random subgraph of the hypercube
Three theorems regarding testing graph properties
Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
Thermodynamic limit for large random trees
A randomized construction of high girth regular graphs
Regularity properties for triple systems
Large deviations for mean field models of probabilistic cellular automata
Notes on growing a tree in a graph
Probabilistic consequences of some polynomial recurrences
Expectation Transfer between Branching Processes and Random Trees
Equitable coloring of random graphs
Quasi-polynomial mixing of critical two-dimensional random cluster models
On random k -out subgraphs of large graphs
Random unary predicates: Almost sure theories and countable models
On the asymptotic behavior of some algorithms
Testing low-degree polynomials over prime fields
1-independent percolation on ℤ 2 × K n
An elementary analysis of a procedure for sampling points in a convex body
Improved bounds and algorithms for hypergraph 2-coloring
Asymptotic normality of the size of the giant component in a random hypergraph
On the Genus of a Random Graph
Fast mixing for independent sets, colorings, and other models on trees
The Random-Facet simplex algorithm on combinatorial cubes
Levels of a scale-free tree
Limiting shape of the depth first search tree in an Erdős-Rényi graph
Self-destructive percolation as a limit of forest-fire models on regular rooted trees
Testing properties of functions on finite groups
Extremes of the internal energy of the Potts model on cubic graphs
An elementary proof of a theorem of Johnson and Lindenstrauss
Degree distribution of the greatest common divisor of polynomials over F q
Invariant Gaussian processes and independent sets on regular graphs of large girth
The chance that a convex body is lattice-point free: A relative of Buffon's needle problem
Cliques in dense inhomogeneous random graphs
The vertex degree distribution of random intersection graphs
The cores of random hypergraphs with a given degree sequence
Permutations avoiding a pattern of length three under Mallows distributions
A Passage Time for Greedy-Coloring Cycles
Spanning embeddings of arrangeable graphs with sublinear bandwidth
On longest paths and diameter in random apollonian network
Phase transition in random intersection graphs with communities
Random railways modeled as random 3-regular graphs
Steady state analysis of balanced-allocation routing
Weak quasi-randomness for uniform hypergraphs
The hitting time of clique factors
Mixing properties of the Swendsen-Wang process on classes of graphs
Random generation of 2×n contingency tables
Partitioning graphs with linear minimum degree
Cycle structure of random permutations with cycle weights
Four-term progression free sets with three-term progressions in all large subsets
Hamilton cycles containing randomly selected edges in random regular graphs
A combinatorial design approach to MAXCUT
A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph
Testability and repair of hereditary hypergraph properties
De Bruijn cycles for covering codes
Random directed graphs are robustly Hamiltonian
On the vanishing of homology in random Čech complexes
Acyclic Coloring of Graphs
Successive minimum spanning trees
On characterizing hypergraph regularity
The rotation correspondence is asymptotically a dilatation
On the Number of Cycles of Given Length of a Free Word in Several Random Permutations
Partial resampling to approximate covering integer programs
The order of the giant component of random hypergraphs
The strong chromatic index of C4-free graphs
How Much Homogeneous Can the Appearing Pattern Be?
On smoothed analysis in dense graphs and formulas
Finding Hidden Hamiltonian Cycles
Meyniel's conjecture holds for random graphs
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs
On the profile of random trees
Asymptotic enumeration of sparse 2-connected graphs
Constructing near spanning trees with few local inspections
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
A stability result for balanced dictatorships in S n
DP-Coloring of Graphs From Random Covers
On the Independence Number of Sparse Graphs
Continuum percolation with steps in the square or the disc
Moderate deviations in cycle count
The C ℓ -free process
Greedy maximal independent sets via local limits
Uniform and minimal essential spanning forests on trees
Quasi-Random Classes of Hypergraphs
Correction: Small worlds
The Ramsey Number R(3, t) Has Order of Magnitude t 2 /log t
The thresholds for diameter 2 in random Cayley graphs
Chromatic thresholds in sparse random graphs
A study of random Weyl trees
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs
Asymptotically optimal neighbour sum distinguishing colourings of graphs
On the Number of Sparse Connected Graphs
Unlabeled Trees: Distribution of the Maximum Degree
Deterministic algorithms for matrix completion
On restricted min-wise independence of permutations
Total variation asymptotics for independent process approximations of logarithmic multisets and selections
The average-case area of Heilbronn-type triangles
Boolean complexity classes vs. their arithmetic analogs
Quasi-randomness of graph balanced cut properties
General urn models with several types of balls and Gaussian limiting fields
Small Cliques in Random Graphs
Percolation in Voronoi tilings
Singular vectors under random perturbation
Corrigendum: The complexity of counting graph homomorphisms
Embracing the giant component
Random maximal H-free graphs
Phase transitions in graphs on orientable surfaces
Rate of convergence of crossover operators
The computational complexity of two-state spin systems
First passage percolation and escape strategies
On the rank of random matrices
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
On triangle-free random graphs
Greedy colorings of uniform hypergraphs
The number of graphs and a random graph with a given degree sequence
Random walks on simplicial complexes and harmonics
Probabilistic strategies for the partition and plurality problems
Scale-free graphs of increasing degree
Random Graphs and Systems of Linear Equations in Finite Fields
Random triangles in random graphs
The random planar graph process
Predecessors in a random mapping
m-ary Search trees when m ge 27: A strong asymptotics for the space requirements
The spectral gap of random regular graphs
The largest induced tree in a sparse random graph
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
The real tau-conjecture is true on average
The asynchronous DeGroot dynamics
On the Number of Connected Subgraphs with Small Edge-Boundary in Regular Graphs
Vertex Ramsey properties of randomly perturbed graphs
Constructions of Permutation Arrays for Certain Scheduling Cost Measures
Ramsey goodness of trees in random graphs
The decomposition threshold for bipartite graphs with minimum degree one
Hypergraph regularity and random sampling
An O(n 2 ) bound for the relaxation time of a Markov chain on cladograms
A Tight Upper Bound on the Cover Time for Random Walks on Graphs
Most edge-orderings of Kn have maximal altitude
Cover time and mixing time of random walks on dynamic graphs
Profiles of random trees: Plane-oriented recursive trees
Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees
Random walks on random simple graphs
A family of random trees with random edge lengths
On the effect of selection in genetic algorithms
A linear programming perspective on the Frankl - Rödl - Pippenger theorem
The threshold for d-collapsibility in random complexes
On mixing times for stratified walks on the d-cube
Juntas in the ℓ 1 -grid and Lipschitz maps between discrete tori
Approximating sparse graphs: The random overlapping communities model
Book Ramsey numbers. I
Phase transitions of Best-of-two and Best-of-three on stochastic block models
Bond percolation critical probability bounds for three Archimedean lattices
The Giant Component 1960-1993
On a rainbow extremal problem for color-critical graphs
Hypergraph Ramsey numbers of cliques versus stars
Randomized Greedy Matching
On finding a minimum spanning tree in a network with random weights