yusuke1997/dblp-id-title huggingface dataset:
On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
The (7, 4)-Conjecture in Finite Groups
Reconstructing a Graph from its Neighborhood Lists
A Characterization of Easily Testable Induced Subgraphs
On the Erdős-Sós conjecture for trees with bounded degree
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
Area and Inertial Moment of Dyck Paths
Constrained Ramsey Numbers
Erratum: On Regularity Lemmas and their Algorithmic Applications
On Irreducible Maps and Slices
Supersaturation of even linear cycles in linear hypergraphs
A Random Recolouring Method for Graphs and Hypergrams
Spanning trees in random regular uniform hypergraphs
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
Counting Partial Orders With A Fixed Number Of Comparable Pairs
A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem
How Do Read-Once Formulae Shrink?
An asymptotic bound for the strong chromatic number
An Upper Bound on the Size of Avoidance Couplings
On a Speculated Relation Between Chvátal-Sankoff Constants of Several Sequences
New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs
Counting independent sets in structured graphs
On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices
First-Order Definability of Trees and Sparse Random Graphs
Extremal problems for GCDs
On Twisted Odd Graphs
Approximately symmetric forms far from being exactly symmetric
On Statistics of Permutations Chosen From the Ewens Distribution
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
Weighted counting of solutions to sparse systems of equations
A Binary Deletion Channel With a Fixed Number of Deletions
Set Systems Containing Many Maximal Chains
On a Theorem of Ganter
The Distribution of Heights of Binary Trees and Other Simple Trees
Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory
The Entropy of Random-Free Graphons and Properties
Monotonicity of Avoidance Coupling on KN
A General Spectral Bound For Distant Vertex Subsets
Turán-Ramsey Theorems and K p -Independence Numbers
A Note on a Question of Erdos and Graham
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
Packing Circuits Into KN
( k +1)-Cores Have k -Factors
Forcing a sparse minor
Measurable Events Indexed by Trees
Additive Decompositions, Random Allocations, and Threshold Phenomena
Jaeger's Conjecture
Mixing properties of colourings of the ℤd lattice
Decision Trees and Influences of Variables Over Product Probability Spaces
Reversal of Markov Chains and the Forget Time
Some Constructions In The Inverse Spectral Theory Of Cyclic Groups
Reimer's Inequality on a Finite Distributive Lattice
Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
On the choosability of -minor-free graphs
Autocorrelations of Random Binary Sequences
Orthogonal Latin Rectangles
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs
Tail Estimates for Sums of Variables Sampled by a Random Walk
Subsequence Sums
Finding tight Hamilton cycles in random hypergraphs faster
Excluding Minors in Cubic Graphs
Threshold Functions for Markov Chains: a Graph Theoretic Approach
proof of a Packing Conjecture of Bollobás
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
Face enumeration for split matroid polytopes
Independent Transversals and Independent Coverings in Sparse Partite Graphs
Blocking Sets in SQS(2u)
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
On Quantitative Noise Stability and Influences for Discrete and Continuous Models
Path Ramsey Number for Random Graphs
On convex holes in d-dimensional point sets
Graphs with Large Girth Not Embeddable in the Sphere
Cycles And Unicyclic Components In Random Graphs
Breaking bivariate records
Median Eigenvalues of Bipartite Subcubic Graphs
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Multiple random walks on graphs: mixing few to cover many
Limit Theorems for Subtree Size Profiles of Increasing Trees
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
Increments of Random Partitions
On the Size-Ramsey Number of Cycles
Strong Convergence of Partial Match Queries in Random Quadtrees
Homomorphism-Homogeneous Relational Structures
Packing Graphs of Bounded Codegree
The k-Core and Branching Processes
On The Automorphism Groups Of Dowling Geometries
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
Connectedness Of The Degree Bounded Star Process
Non-Three-Colourable Common Graphs Exist
Patterns in Random Permutations Avoiding the Pattern 132
Random Records and Cuttings in Binary Search Trees
And/Or Trees Revisited
Edge-Isoperimetric Inequalities and Influences
Combinatorial Analysis of Growth Models for Series-Parallel Networks
The chromatic profile of locally colourable graphs
Approximating Cayley Diagrams Versus Cayley Graphs
Saturated Subgraphs of the Hypercube
Graphs, Links, and Duality on Surfaces
Schütte's Tournament Problem and Intersecting Families of Sets
The Number of Satisfying Assignments of Random Regular k-SAT Formulas
Cops and Robbers on Geometric Graphs
Sign-Coherent Identities for Characteristic Polynomials of Matroids
Extremal Combinatorics: with Applications in Computer Science by Stasys Jukna, Springer, 2001, xvii + 375 pp
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
The Compensation Approach for Walks With Small Steps in the Quarter Plane
My Friend and Colleague, Richard Schelp
Optimal mixing via tensorization for random independent sets on arbitrary trees
Automorphism Groups of Metacirculant Graphs of Order a Product of Two Distinct Primes
On the Non-Planarity of a Random Subgraph
The Offset Problem
On Colourings of Hypergraphs Without Monochromatic Fano Planes
Self-Affine Carpets on the Square Lattice
Monochromatic trees in random tournaments
Threshold Channel Graphs
Turán-type results for intersection graphs of boxes
Topics in Algebraic Graph Theory, by Lowell W. Beineke and Robin J. Wilson (Academic Consultant: Peter J. Cameron), Encyclopedia of Mathematics and its Applications 102, CUP 2005, 257pp., GBP 50.00/$95.00
Intersecting Families are Essentially Contained in Juntas
On the Strong Chromatic Number of Random Graphs
Parametrized Tutte Polynomials of Graphs and Matroids
Almost Every Tree With m Edges Decomposes K 2 m , 2 m
An approximate version of Jackson's conjecture
Quasipolynomial-time algorithms for Gibbs point processes
Negative Correlation in Graphs and Matroids
Philippe Flajolet 1 December 1948 - 22 March 2011
Minimizing the number of 5-cycles in graphs with given edge-density
On Compound Poisson Approximation For Sequence Matching
On the Number of 4-Edge Paths in Graphs With Given Edge Density
Hamilton Cycles in Oriented Graphs
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes
Fast Strategies In Maker-Breaker Games Played on Random Boards
The Harmonious Chromatic Number of Almost All Trees
An Application of Hindman's Theorem to a Problem on Communication Complexity
Independent sets of a given size and structure in the hypercube
Triangles in randomly perturbed graphs
On r -Cross Intersecting Families of Sets
Pattern Avoidance And Overlap In Strings
Contractible Elements in Graphs and Matroids
Parking on a Random Tree
Spanning -cycles in random graphs
The List-Ramsey threshold for families of graphs
On the Ramsey numbers of daisies II
Distant Vertex Partitions of Graphs
Matroid Duality From Topological Duality In Surfaces Of Nonnegative Euler Characteristic
Couplings and Poisson approximation for stabilising functionals of determinantal point processes
Permutations with equal orders
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
Directed Graphs Without Short Cycles
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Optimal Codes in the Enomoto-Katona Space
Turán problems in pseudorandom graphs
Step Size in Stein's Method of Exchangeable Pairs
Packing Loose Hamilton Cycles
Limit Law of the Length of the Standard Right Factor of a Lyndon Word
Triangle-Free Graphs with Large Degree
Critical Window for Connectivity in the Configuration Model
Daisies and Other Turán Problems
Optimal group testing
Long induced paths in expanders
Difference Covers
Point Selections and Weak e-Nets for Convex Hulls
When is an Almost Monochromatic K 4 Guaranteed?
Triangle-Free Subgraphs of Random Graphs
An Upper Bound on Zarankiewicz' Problem
One More Probabilistic Reformulation of the Four Colour Conjecture
Computing Norms of group-Invariant Transition Operators
Simplifying Inclusion-Exclusion Formulas
Connections in Randomly Oriented Graphs
Information Transmission under Random Emission Constraints
Small Submatroids in Random Matroids
On Local Expansion of Vertex-Transitive Graphs
Spanning trees in graphs without large bipartite holes
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles
Almost Odd Random Sum-Free Sets
Set Families With a Forbidden Induced Subposet
Constructing Trees In Graphs Whose Complement Has No K2, S
Order-Invariant Measures on Fixed Causal Sets
Partitioning Matroids With Only Small Cocircuits
A note on the Brown-Erdős-Sós conjecture in groups
Probabilistic Number Theory, the GEM/Poisson-Dirichlet Distribution and the Arc-sine Law
Packing Ferrers Shapes
Upper Bounds for Online Ramsey Games in Random Graphs
Integer Partitions, by George E. Andrews and Kimmo Eriksson, Cambridge University Press 2004
Using Symmetry to Improve Percolation Threshold Bounds
Freiman Homomorphisms of Random Subsets of
Topological cliques in graphs 2
Expansion of Percolation Critical Points for Hamming Graphs
Plane Cubic Graphs with Prescribed Face Areas
Sets in Almost General Position
Subdivisions of K r+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth
The $k$-Equal Problem
Optimally Reliable Graphs for Both Vertex and Edge Failures
A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
Universality of Graphs with Few Triangles and Anti-Triangles
Local-Global Phenomena in Graphs
The Degree Sequence of Random Graphs from Subcritical Classes
Autocorrelation and the Enumeration of Strings Avoiding a Fixed String
Fractional Clique Decompositions of Dense Partite Graphs
On the number of error correcting codes
Maximal Spacing Configurations in Graphs
The Number of Independent Sets in a Regular Graph
On The Lock-In Probability Of Stochastic Approximation
Matchings in Lattice Graphs and Hamming Graphs
Tuza's Conjecture is Asymptotically Tight for Dense Graphs
On the Number of Edges in Random Planar Graphs
The Angel of Power 2 Wins
Spanning Subgraphs Of Random Graphs
Odd Independent Transversals are Odd
On the Edge-Expansion of Graphs
On the mixing time of coordinate Hit-and-Run
An Entropy Approach to the Hard-Core Model on Bipartite Graphs
The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds
Asymptotic Normality Through Factorial Cumulants and Partition Identities
On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
Induced Turán Numbers
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
A note on digraph splitting
Reliable Fault Diagnosis with Few Tests
Turán Numbers of Multiple Paths and Equibipartite Forests
An Algebraic Proof of Deuber's Theorem
On the number of symbols that forces a transversal
Graph Colouring with No Large Monochromatic Components
Threshold Functions for H-factors
Incidences in Three Dimensions and Distinct Distances in the Plane
A note on distinct distances
Polarised random -SAT
Generating Random Regular Graphs Quickly
On Subsequence Weighted Products
A Symbolic Method to Analyse Patterns in Plant Structure
Measures of Pseudorandomness for Finite Sequences: Minimal Values
Large-Deviation Approximations for General Occupancy Models
A Zero-Free Interval for Chromatic Polynomials of Graphs
On Weighted Sequence Sums
Invariant Measure Under the Affine Group Over
Large N behaviour of the two-dimensional Yang-Mills partition function
Eigenvalues of Graphs and Sobolev Inequalities
The Harmonious Chromatic Number of Bounded Degree Trees
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
Restricted Edge-colourings of Bipartite Graphs
Complexity of Ising Polynomials
Counting Independent Sets in Hypergraphs
Conditional Independences among Four Random Variables 1
Smallest sets of Longest Paths with Empty Intersection
On the size-Ramsey number of grid graphs
Semi-Strong Colouring of Intersecting Hypergraphs
Arithmetic Progressions in Sets with Small Sumsets
On the size-Ramsey number of grids
A Stability Result for Families with Fixed Diameter
Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
New Bounds for Edge-Cover by Random Walk
G-Intersecting Families
The Maximum Displacement for Linear Probing Hashing
All Maximum Size Two-Part Sperner Systems: In Short
Random Lifts of Graphs: Edge Expansion
Finding an Unknown Acyclic Orientation of a Given Graph
On Dominating Sets And Independent Sets Of Graphs
Factorization in Fq(x) and Brownian Motion
Gaussian Distribution of Trie Depth for Strongly Tame Sources
Abelian groups from random hypergraphs
Partial Shadows of Set Systems
On a Question of Bourgain about Geometric Incidences
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
On the Number of B h -Sets
Sharp concentration of the equitable chromatic number of dense random graphs
The Density Turán Problem
Distribution of tree parameters by martingale approach
Diagonal Asymptotics for Products of Combinatorial Classes
Random Star Processes
Bootstrap Percolation in High Dimensions
Subset sums in N 2
Hamiltonian Cycles in Regular Tournaments
On oriented cycles in randomly perturbed digraphs
Lipschitz bijections between boolean functions
Triangle-free subgraphs with large fractional chromatic number
Triangles in Regular Graphs with Density Below One Half
Tight Bounds for Blind Search on the Integers and the Reals
A Tutte Polynomial for Maps
A bipartite version of the Erdős-McKay conjecture
Function Learning From Interpolation
A Rate for the Erdös-Turán Law
On Dependency Graphs and the Lattice Gas
Limit laws of planar maps with prescribed vertex degrees
Exit Frequency Matrices for Finite Markov Chains
On the exponential growth rates of lattice animals and interfaces
The Clarkson-Shor Technique Revisited And Extended
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
WDM and Directed Star Arboricity
Sparse recovery properties of discrete random matrices
Constructing Small Sets that are Uniform in Arithmetic Progressions
Duality in Infinite Graphs
Extremal Functions for Shortening Sets of Paths
On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs
On Brooks' Theorem for Sparse Graphs
Economical Elimination of Cycles in the Torus
Comparisons in Hoare's Find Algorithm
Query Complexity of Sampling and Small Geometric Partitions
Deterministic Graphs Games and a Probabilistic Intuition
The Blind Passenger and the Assignment Problem
On the Ramsey numbers of daisies I
Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree
Detachments of Hypergraphs I: The Berge-Johnson Problem
A Group-Theoretic Setting for Some Intersecting Sperner Families
On the Independence Number of Steiner Systems
Properties of Large Eden Clusters in the Plane
Amalgemated Factorizations of Complete Graphs
Colourings of Uniform Hypergraphs with Large Girth and Applications
On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm
A Note on Universal and Canonically Coloured Sequences
Distinct Distances from Three Points
Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes
Essential covers of the hypercube require many hyperplanes
Distinct Distances in Three and Higher Dimensions
Long-Range Percolation Mixing Time
Noisy group testing via spatial coupling
A blurred view of Van der Waerden type theorems
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal
Improved Bounds for Incidences Between Points and Circles
Ramsey upper density of infinite graphs
Searching for a Black Hole in Synchronous Tree Networks
Spin Glasses: A Challenge for Mathematicians - Cavity and Mean Field Models, cby Michel Talagrand
Cliques in Graphs With Bounded Minimum Degree
Perfect Hashing and Probability
Problems and results on 1-cross-intersecting set pair systems
A Combinatorial Approach to the Two-Sided Exit Problem for Left-Continuous Random Walks
The Generic Chaining: Upper and Lower Bounds of Stochastic Processes, by Michel Talagrand , Springer-Verlag, 2005
Local Conditions for Exponentially Many Subdivisions
An Average Set Size Theorem
Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004
Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem
Linear Index Coding via Semidefinite Programming
On a Random Graph Related to Quantum Theory
On The Circuit Cover Problemfor Mixed Graphs
The Distribution of Patterns in Random Trees
Searches On A Binary Tree With Random Edge-Weights
Volumes in the Uniform Infinite Planar Triangulation: From Skeletons to Generating Functions
Percolation on irregular high-dimensional product graphs
Extensions of the Polynomial Hales-Jewett Theorem
On the Chromatic Thresholds of Hypergraphs
A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles
Information Loss In Riffle Shuffling
Continuous phase transitions on Galton-Watson trees
The Random-Cluster Model , by Geoffrey Grimmett, Springer, 2006
Large Topological Cliques in Graphs Without a 4-Cycle
'The Asymptotic Number of Connected d -Uniform Hypergraphs' - CORRIGENDUM
Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
Spanning subdivisions in Dirac graphs
Vicarious Graphs
Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp
Edge Colouring with Delays
A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability
Winning Fast in Sparse Graph Construction Games
A Lower Bound on the Size of Lipschitz Subsets in Dimension 3
Applications of a New Separator Theorem for String Graphs
Unusually large components in near-critical Erdős-Rényi graphs via ballot theorems
Large monochromatic components in expansive hypergraphs
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
The Minesweeper Game: Percolation And Complexity
On Measures of Average Degree for Lattices
A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
Height function localisation on trees
The Maximum Degree of the Barabasi-Albert Random Tree
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp
Image Partition Regularity of Matrices
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
Adding Edges to Increase the Chromatic Number of a Graph
A New Bound for the 2/3 Conjecture
On 14-Cycle-Free Subgraphs of the Hypercube
Almost Isoperimetric Subsets of the Discrete Cube
Subcritical Graph Classes Containing All Planar Graphs
Distribution of the Steiner Distance in Generalized M-ary Search Trees
On the Importance Sampling of Self-Avoiding Walks
Concentration of Size and Path Length of Tries
Best Odds for Finding a Perfect Matching in a Bipartite Graph
A simplified disproof of Beck's three permutations conjecture and an application to root-mean-squared discrepancy
Tied Favourite Edges for Simple Random Walk
On the Laplacian Eigenvalues of G n, p
Constructing families of cospectral regular graphs
Reconstructing Odd Necklaces
Approximating The Satisfiability Threshold For Random K-Xor-Formulas
List Colourings of Regular Hypergraphs
Maximum Waiting Times are Asymptotically Independent
Asymmetric Rényi Problem
Packings in Dense Regular Graphs
An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
On the Chromatic Number of Random Cayley Graphs
On Regularity Lemmas and their Algorithmic Applications
On Active and Passive Testing
Waiting for a Bat to Fly By (in Polynomial Time)
The Minimum Size Of Saturated Hypergraphs
Card guessing with partial feedback
Cutsets in Infinite Graphs
A Note on Freiman's Theorem in Vector Spaces
Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
A Ratio Inequality For Binary Trees And The Best Secretary
Minimum Degree and Disjoint Cycles in Claw-Free Graphs
Shape Measures of Random Increasing k -trees
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography
Indistinguishable Sceneries on the Boolean Hypercube
Random Permutations: Some Group-Theoretic Aspects
Irregular subgraphs
On Generalized Random Railways
Creating a Giant Component
Balanced Signings and the Chromatic Number of Oriented Matroids
On Even-Degree Subgraphs of Linear Hypergraphs
On the subgraph query problem
Hypergraph Packing and Sparse Bipartite Ramsey Numbers
On Directed Versions of the Hajnal-Szemerédi Theorem
Minor-Minimal Planar Graphs of Even Branch-Width
Saturated Graphs of Prescribed Minimum Degree
Concentration For Independent Permutations
On the Brownian separable permuton
A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
An Approximation by Lacunary Sequence of Vectors
Markov Processes and Ramsey Theory for Trees
On the Distribution of Three-Term Arithmetic Progressions in Sparse Subsets of F p n
A large deviation principle for block models
Positive Influence and Negative Dependence
Predecessors in Random Mappings
On the Number of Incidences Between Points and Curves
Exact Minimum Codegree Threshold for K - 4-Factors
From GEM back to Dirichlet via Hoppe's Urn
Normal Numbers and the Normality Measure
The Asymptotic Proportion of Subdivisions of a 2×2 Table that Result in Simpson's Paradox
Most Probably Intersecting Families of Subsets
Evaluations of Topological Tutte Polynomials
Characterization Results Based On A Functional Derivative Approach
Packing Hamilton Cycles Online
Sampling Regular Graphs and a Peer-to-Peer Network
Hitting Time Theorems for Random Matrices
Modular Counting and Substitution of Structures
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$
Pseudorandom hypergraph matchings
Poisson Representation of a Ewens Fragmentation Process
On (Not) Computing the Möbius Function Using Bounded Depth Circuits
Colouring Random 4-Regular Graphs
Minimizing the Number of Triangular Edges
Random Matrices and Brownian Motion
A Graph-Grabbing Game
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
Robust Tverberg and Colourful Carathéodory Results via Random Choice
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
Some Inequalities for Whitney-Tutte Polynomials
The Complexity of Counting Colourings of Subgraphs of the Grid
On Independent Sets in Graphs with Given Minimum Degree
Hereditary Properties Of Triple Systems
Open Problems in Partition Regularity
Sampling biased monotonic surfaces using exponential metrics
Surprise Probabilities in Markov Chains
Period Lengths for Iterated Functions
On the size of temporal cliques in subcritical random temporal graphs
Longest Paths in Circular Arc Graphs
Decomposition of Multiple Packings with Subquadratic Union Complexity
The Random Graph Intuition for the Tournament Game
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem