yusuke1997/dblp-id-title huggingface dataset:
Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
Toward a High-Dimensional Dirac's Theorem
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
On the Cardinality of Sets in $R^d$ Obeying a Slightly Obtuse Angle Bound
Upper Bounds on Mixing Time of Finite Markov Chains
On Tensor Powers of Integer Programs
Multiple Random Walks in Random Regular Graphs
Localized Eigenvectors from Widely Spaced Matrix Modifications
An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph
The Tradeoff Function for a Class of $\mathrm{RLL}(d, k)$ Constraints
Balancing Degree, Diameter, and Weight in Euclidean Spanners
Concentration of Random Determinants and Permanent Estimators
A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type
A Stability Result on Matchings in 3-Uniform Hypergraphs
Sink-Stable Sets of Digraphs
The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4
Highly Connected Subgraphs with Large Chromatic Number
Laplacians for flow networks
An Activities Expansion of the Transition Polynomial of a Multimatroid
Testing Triangle-Freeness in General Graphs
Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders
Isostatic Block and Hole Frameworks
Reduction of Rota's Basis Conjecture to a Problem on Three Bases
On the Turán Number of Generalized Theta Graphs
Average Performance of Heuristics for Satisfiability
Replacement Paths via Row Minima of Concise Matrices
Ramsey Goodness of Cycles
Erratum: An Integer Program for Codes
Note on Large Subsets of Binary Vectors with Similar Distances
Avoiding Monochromatic Sequences With Special Gaps
Matroids Induced by Packing Subgraphs
Escape Rates for Rotor Walks in Z d
Bernoulli Factories for Flow-Based Polytopes
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
Extremal Cayley Digraphs of Finite Cyclic Groups
Blocks and Cut Vertices of the Buneman Graph
Minimal Balanced Triangulations of Sphere Bundles over the Circle
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids
The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs
MaxMinSum Steiner Systems for Access Balancing in Distributed Storage
On k-Submodular Relaxation
Influence of a Set of Variables on a Boolean Function
Binarisation for Valued Constraint Satisfaction Problems
Cubic TSP: A 1.3-Approximation
Color Isomorphic Even Cycles and a Related Ramsey Problem
Arbitrary Orientations of Hamilton Cycles in Digraphs
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization
A Computer-Assisted Proof of the Barnette-Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian
Densest Subgraphs of a Dense Erdös-Rényi Graph. Asymptotics, Landscape, and Universality
Uniform Formulae for Coefficients of Meromorphic Functions in Two Variables. Part I
Constructing Optimal k-Radius Sequences
Dirac's Theorem for Linear Hypergraphs
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs
Partial Cubes and Crossing Graphs
Nonseparating Cycles in 4-Connected Graphs
Extension Complexity of Polytopes with Few Vertices or Facets
Hypercontractivity of Spherical Averages in Hamming Space
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs
On Abstract Rigidity Matroids
A Random Version of Shepp's Urn Scheme
A Probabilistic Approach to Generalized Zeckendorf Decompositions
Single Machine Scheduling with Release Dates
A Complete Generalization of Clatworthy Group Divisible Designs
A New Proof of the H-Coloring Dichotomy
Representation Complexities of SemiAlgebraic Graphs
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
Refined Vertex Sparsifiers of Planar Graphs
A Characterization of Generically Rigid Frameworks on Surfaces of Revolution
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs
The Typical Structure of Gallai Colorings and Their Extremal Graphs
Length of the Longest Common Subsequence between Overlapping Words
Geodetic Number versus Hull Number in P 3 -Convexity
Conflict-Free Coloring of Graphs
Induced Matchings in Graphs of Degree at Most 4
A 2 d -1 Lower Bound for Two-Layer Knock-Knee Channel Routing
Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images
Network Perturbations and Asymptotic Periodicity of Recurrent Flows in Infinite Networks
Wide-Sense Nonblocking Networks
Growth of Edge-Homogeneous Tessellations
On Generalized Delannoy Paths
Hedetniemi's Conjecture and Strongly Multiplicative Graphs
The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs
Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
Symbolic Trisection Polynomials for Genus 2 Curves in Odd Characteristic
On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
An Integer Program for Codes
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees
Monomial Tropical Cones for Multicriteria Optimization
Searching for Two Objects by Underweight Feedback
A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems
Euclidean Steiner Spanners: Light and Sparse
On Packable Digraphs
Set Systems without a Strong Simplex
Edge-Connectivity Augmentation of Simple Graphs
Skew Hadamard Difference Sets from Cyclotomic Strongly Regular Graphs
The Glauber Dynamics for Colorings of Bounded Degree Trees
On the Complexity of Some Enumeration Problems for Matroids
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
Generalized Schur Function Determinants Using the Bazin Identity
Decomposing 4-Regular Graphs into Triangle-Free 2-Factors
Sparse Graphs Are Not Flammable
Three Generalizations of Davenport-Schinzel Sequences
A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time
Hypergraphs of Bounded Disjointness
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph
On cost matrices with two and three distinct values of Hamiltonian paths and cycles
The PMU Placement Problem
Embedding Partial Steiner Triple Systems with Few Triples
Flows on Signed Graphs without Long Barbells
Weighted Games of Best Choice
Abelian Networks I. Foundations and Examples
More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints
Locally Symmetric Graphs of Prescribed Girth and Coxeter Groups
A Point-Variety Incidence Theorem over Finite Fields, and Its Applications
Large Homogeneous Submatrices
Partial Permutation and Alternating Sign Matrix Polytopes
The Maker-Breaker Rado Game on a Random Set of Integers
On 3-Connected Graphs of Path-Width at Most Three
Monotone Proper Interval Digraphs and Min-Max Orderings
On the b-Stable Set Polytope of Graphs without Bad K 4
Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation
A Bounded Diameter Strengthening of Kőnig's Theorem
Pattern Colored Hamilton Cycles in Random Graphs
Extremal Graphs with Local Covering Conditions
Minimum T-Joins and Signed-Circuit Covering
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples
Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices
Edge-Chromatic Scheduling with Simultaneity Constraints
On Approximate Solutions for Combinatorial Optimization Problems
On the Optimality of Coloring with a Lattice
Near Perfect Matchings in k-Uniform Hypergraphs II
Ramsey Goodness of Clique Versus Paths in Random Graphs
The Nine Morse Generic Tetrahedra
Jumps and Nonjumps in Multigraphs
A Local Approach to the Erdös-Sós Conjecture
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
A Tight Lower Bound for Online Monotonic List Labeling
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
Kernelization Lower Bounds by Cross-Composition
Templates for Binary Matroids
Discrete Point X-rays
An Explicit Bound On Double Exponential Sums Related to Diffie--Hellman Distributions
On the Turán Number of Edge Blow-Ups of Cliques
On the Number of Neighbors in Normal Tiling
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
Maximum Weight Partial Colorings on Sparse Random Graphs
Decomposition of Binary Signed-Graphic Matroids
Rerouting Flows when Links Fail
A Simpler Self-reduction Algorithm for Matroid Path-Width
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
Quasi-Symmetric 3-Designs and Elliptic Curves
The Corners of Core Partitions
Finite Dynamical Systems, Hat Games, and Coding Theory
Equitable Coloring of k-Uniform Hypergraphs
Bound Smoothing under Chirality Constraints
A Splitter Theorem for Internally 4-Connected Binary Matroids
The Dimension of the Region of Feasible Tournament Profiles
Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences
On the Fast Computation of the Weight Enumerator Polynomial and the t Value of Digital Nets over Finite Abelian Groups
Packing Arborescences in Random Digraphs
Sum-Free Sets of Integers with a Forbidden Sum
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
On k-Resonant Fullerene Graphs
Colorful Hamilton Cycles in Random Graphs
Edges Not Covered by Monochromatic Bipartite Graph
Three-Stage Generalized Connectors
Circulants and Sequences
Packing Directed Hamilton Cycles Online
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs
Duality Theorems for Blocks and Tangles in Graphs
Maximizing the Shannon Capacity of Constrained Systems with Two Constraints
Planar Convex Codes are Decidable
Connected Domination and Spanning Trees with Many Leaves
Odd Hole Recognition in Graphs of Bounded Clique Size
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
A Lower Bound on the Transposition Diameter
Eulerian Subgraphs Containing Given Vertices
The Discrete Sine Transform and the Spectrum of the Finite q -ary Tree
NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence
River Routing with a Small Number of Jogs
The Second-Moment Phenomenon for Monochromatic Subgraphs
On the Cover Time of the Emerging Giant
On the Concentration of the Domination Number of the Random Graph
The Number of Permutations Realized By a Shift
Extremal Graphs without Topological Complete Subgraphs
Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity
Nondegenerate Neural Codes and Obstructions to Closed-Convexity
On Double-Resolution Imaging and Discrete Tomography
Covering a Graph by Forests and a Matching
Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two
The Cut Metric for Probability Distributions
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections
Equitable Coloring of Sparse Planar Graphs
A Note on Independent Sets in Trees
The Minimal Hitting Set Generation Problem: Algorithms and Computation
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
Optimal Tree Structures for Group Key Management with Batch Updates
The Zero Forcing Number of Graphs
Combing a Linkage in an Annulus
Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three
Tensor Codes and Their Invariants
Acyclic Homomorphisms and Circular Colorings of Digraphs
One-Point Concentration of the Clique and Chromatic Numbers of the Random Cayley Graph on 픽 2
A Rainbow Dirac's Theorem
On Dyadic Fractional Packings of $T$-Joins
Empty Pentagons in Point Sets with Collinearities
On the Cover Time of Dense Graphs
Shallow Minors, Graph Products, and Beyond-Planar Graphs
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski
The Combinatorics of Perfect Authentication Schemes
On a Discrete Brunn-Minkowski Type Inequality
Planar Separators
Left-Cut-Percolation and Induced-Sidorenko Bigraphs
Noncrossing Arc Diagrams and Canonical Join Representations
On the Dimension of the Hull
Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems
Node-Packing Problems with Integer Rounding Properties
The Ultimate Categorical Independence Ratio of Complete Multipartite Graphs
Longest Cycle above Erdős-Gallai Bound
Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks
On "stability" in the Erdös-Ko-Rado Theorem
Listen to Your Neighbors: How (Not) to Reach a Consensus
A General Framework for Hypergraph Coloring
A Combinatorial Approach to the Symmetry of q, t-Catalan Numbers
Cops and Robber with Constraints
Kneser Representations of Graphs
Lollipop and Lariat Symmetric Functions
Topological Bounds for Graph Representations over Any Field
A Note on Planar Graphs and Circle Orders
A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling
Large Rainbow Cliques in Randomly Perturbed Dense Graphs
Integer Flows and Modulo Orientations of Signed Graphs
A Note on Multiset Permutations
Midpoints of Vertex Pairs of Convex Polytopes
Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition
Labeled Partitions and the q-Derangement Numbers
Almost All Friendly Matrices Have Many Obstructions
Counting Stars and Other Small Subgraphs in Sublinear-Time
The Balanced Decomposition Number and Vertex Connectivity
Turán's Theorem in the Hypercube
Optimal Control for Diffusions on Graphs
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
A Note on Counting Connected Graph Covering Projections
Factor of IID Percolation on Trees
Binary Linear Codes with Near-Extremal Maximum Distance
On the p -Edge Clique Cover Number of Complete Bipartite Graphs
A New Bound for Hadwiger's Covering Problem in \(\boldsymbol{\mathbb{E}}^3\)
On Two Classical Ramsey Numbers of the Form R(3, n)
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
Computing the Stretch of an Embedded Graph
Rainbow Saturation and Graph Capacities
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications
Memoryless Rules for Achlioptas Processes
Packing k-Matchings and k-Critical Graphs
Rational Exponents for Cliques
Maximum Size of Reverse-Free Sets of Permutations
K 6 -Minors in Triangulations on the Klein Bottle
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree
Linear Orderings of Subfamilies of AT-Free Graphs
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable
3-Facial Coloring of Plane Graphs
Obnoxious Facility Location on Graphs
A Two-Set Problem on Coloring the Integers
An Assmus-Mattson Theorem for Rank Metric Codes
Disjoint Color-Avoiding Triangles
A New Triangulation for Simplicial Algorithms
Intertwining Connectivity in Matroids
On the Existence of K 5 \setminuse -Designs with Application to Optical Networks
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph
A Remark on Sieving in Biased Coin Convolutions
Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles
Axis-Aligned Subdivisions with Low Stabbing Numbers
Packing Squares with Profits
Odd Cycle Transversals and Independent Sets in Fullerene Graphs
A Bound on the Minimum Distance of Quasi-cyclic Codes
On the Weakness of an Ordered Set
Multicovering Bounds from Relative Covering Radii
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
The Graph of Linear Extensions Revisited
Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing
Leaf-Reconstructibility of Phylogenetic Networks
Minimal Inequalities for an Infinite Relaxation of Integer Programs
On Planar Quasi-Parity Graphs
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
Multipartition Series
Computing the Tandem Duplication Distance is NP-Hard
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
Complexity Results for Pomset Languages
Sorting on a Mesh-Connected Computer with Delaying Links
On Cosets of Weight 4 of BCH(2 m , 8), m Even, and Exponential Sums
An Optimal Binding Number Condition for Bipancyclism
On the Metric s-t Path Traveling Salesman Problem
Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs
Littlewood-Offord Inequalities for Random Variables
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths
q -Series Arising From The Study of Random Graphs
On Bipartite Graph Realizations of a Single Degree Sequence
Closedness of Integer Hulls of Simple Conic Sets
On Avoider-Enforcer Games
On Rainbow Matchings for Hypergraphs
Computational Complexity of Biased Diffusion-Limited Aggregation
Perfect Factors from Cyclic Codes and Interleaving
Short Random Walks on Graphs
Triangulating Three-Colored Graphs in Linear Time and Linear Space
An Erdös-Ko-Rado Theorem for the Derangement Graph of PGL 3(q) Acting on the Projective Plane
Connectivity of Random Cubic Sum Graphs
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
Upper Tails for Edge Eigenvalues of Random Graphs
Plane Triangulations Without a Spanning Halin Subgraph II
Maximal Chains and Antichains in Boolean Lattices
The Private Neighbor Cube
The Complexity of Colouring by Semicomplete Digraphs
Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue
On the Circuit Diameter of Some Combinatorial Polytopes
Universal Chains and Wiring Layouts
Advancing the Transposition Distance and Diameter through Lonely Permutations
Hamiltonian Chordal Graphs are not Cycle Extendable
A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees
The Diameter of the Rubik's Cube Group Is Twenty
A Set System Polynomial with Colouring and Reliability Applications
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs
Graphs That Admit Polyline Drawings with Few Crossing Angles
Visibility Number of Directed Graphs
On the 2-Resonance of Fullerenes
Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
Rank Vertex Cover as a Natural Problem for Algebraic Compression
On the Sums of Any k Points in Finite Fields
Classifying Hyperplanes in Hypercubes
Abacus Proofs of Schur Function Identities
Clique Graphs of Chordal and Path Graphs
A Wheels-and-Whirls Theorem for 3-Connected 2-Polymatroids
Matroids and Subset Interconnection Design
Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues
Interlacings for Random Walks on Weighted Graphs and the Interchange Process
Partial Gröbner Bases for Multiobjective Integer Linear Optimization
The Number of Cliques in Graphs Covered by Long Cycles
On the Length of Monotone Paths in Polyhedra
The Decimation Process in Random k-SAT
On the Structure of Some Spaces of Tilings
Rigid Colorings of Hypergraphs and Contiguity
Minimal Ramsey Graphs with Many Vertices of Small Degree
Minimum Degrees for Powers of Paths and Cycles
Switching Distance Between Graphs with the Same Degrees
Constructive Quasi-Ramsey Numbers and Tournament Ranking
Coalescing Random Walks and Voting on Connected Graphs
Extremal Problems for Game Domination Number
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes
Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs
Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable
A Large Deviation Rate and Central Limit Theorem for Horton Ratios
The Obnoxious Center Problem on a Tree
Transversal Hamilton Cycle in Hypergraph Systems
L(2, 1)-Labeling of Hamiltonian graphs with Maximum Degree 3
Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
Building Spanning Trees Quickly in Maker-Breaker Games
On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One
Counting Problems Associated With Steiner Trees In Graphs
A Relative of Hadwiger's Conjecture
Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees
Tree Pivot-Minors and Linear Rank-Width
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓ p
Degree Conditions for Embedding Trees
(1, -1)-Matrices with Near-Extremal Properties
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
Front Representation of Set Partitions
Counting Partitions inside a Rectangle
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
Lower Bounds on Lattice Covering Densities of Simplices
A Genus Bound for Digital Image Boundaries
Tighter Bounds for Graph Steiner Tree Approximation
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
Irregular Assignments of Trees and Forests
Bent Functions, Spreads, and o-Polynomials
Twin-Width of Subdivisions of Multigraphs
Largest Number of Subtrees of Trees with a Given Maximum Degree
Equireplicate Balanced Binary Codes for Oligo Arrays
Nonintersecting Ryser Hypergraphs
Note on the Number of Two-Dimensional Threshold Functions
Deciding the Bell Number for Hereditary Graph Properties
On the Profile of Multiplicities of Complete Subgraphs
First-Fit Coloring of Incomparability Graphs
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
Ramsey Numbers of Books versus Long Cycles
Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems
Coloring the Maximal Cliques of Graphs
On Minimum Degree Implying That a Graph is H-Linked
A Note on Infinite Antichain Density
On the Power of Choice for Boolean Functions
A Note On Reed's Conjecture
Gallai's Theorem for List Coloring of Digraphs
A Curved Brunn-Minkowski Inequality on the Discrete Hypercube, Or: What Is the Ricci Curvature of the Discrete Hypercube?
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
The Number of Maximal Independent Sets in Triangle-Free Graphs
Balancing Covectors
Caterpillar Dualities and Regular Languages
Compact Representations of Cuts
On the Zone Complexity of a Vertex
Bounds for Entries of γ-Vectors of Flag Homology Spheres
Counterexamples to a Conjecture of Harris on Hall Ratio
WalkSAT is Linear on Random 2-SAT
Intertwining Connectivities in Representable Matroids
An Integer Polytope Related to the Design of Survivable Communication Networks
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
Some New Bounds on Single-Change Covering Designs
Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$
On Multicolor Ramsey Numbers of Triple System Paths of Length 3
Constructing New Families of Nested Recursions with Slow Solutions
Pair-Splitting Sets in AG(m, q)
Tree Spanners
The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders