yusuke1997/dblp-id-title huggingface dataset:
Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Z p with p Prime
Simplicial Complexes Satisfying Serre's Condition versus the Ones Which Are Cohen-Macaulay in a Fixed Codimension
Distinguishing Chromatic Number of Cartesian Products of Graphs
On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
Anagram-Free Colorings of Graph Subdivisions
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices
Semidefinite Programming and Ramsey Numbers
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices
Odd Holes in Bull-Free Graphs
Seymour and Woodall's Conjecture Holds for Graphs with Independence Number Two
On Complexity of the Subpattern Problem
Cycles in Graphs and Covers
Tropical Complementarity Problems and Nash Equilibria
Bounds on the Expected Size of the Maximum Agreement Subtree
Classification of Self-Orthogonal Codes over F 3 and F 4
Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness
How Long can a Euclidean Traveling Salesman Tour Be?
Generic Rigidity Matroids with Dilworth Truncations
Packing and Covering Induced Subdivisions
On the Number of Two-Dimensional Threshold Functions
On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams
Extremal Graph Realizations and Graph Laplacian Eigenvalues
Quasisymmetric Functions for Nestohedra
A Majorization Bound for the Eigenvalues of Some Graph Laplacians
Toric Surface Codes and Minkowski Sums
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable
A Comparative Study of Periods in a Periodic-Finite-Type Shift
Improved Randomized Algorithm for k -Submodular Function Maximization
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
Topology of Cut Complexes of Graphs
An 8-Flow Theorem for Signed Graphs
Single-Suit Two-Person Card Play III. The Misère Game
Min-Orderable Digraphs
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
On Ramsey Size-Linear Graphs and Related Questions
Codegree Thresholds for Covering 3-Uniform Hypergraphs
Computing with Voting Trees
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths
A Threshold Function for Harmonic Update
The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings
Integral Cayley Graphs and Groups
Strong Hanani--Tutte on the Projective Plane
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
The Wiener Index of Random Digital Trees
Tropical Lines on Cubic Surfaces
Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks
On the Distribution of Diffie-Hellman Triples with Sparse Exponents
The Turán Number of Berge K_4 in Triple Systems
Symmetric Codes over Rings
Domination Game and an Imagination Strategy
Determining Resistances from Boundary Measurements in Finite Networks
Geometric Sensitivity of Rigid Graphs
A Coding Approach to Signed Graphs
Paths with No Small Angles
Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
On the Maximum Quartet Distance between Phylogenetic Trees
Avoiding Multiple Repetitions in Euclidean Spaces
Sparsification of Two-Variable Valued Constraint Satisfaction Problems
A Combinatorial Proof of a Plethystic Murnaghan-Nakayama Rule
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
The Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2 n \({\boldsymbol{\times C_2}}\)
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
On the Size-Ramsey Number of Tight Paths
Factoring Finite Abelian Groups by Subsets with Maximal Span
Graph Information Ratio
Frames, A-Paths, and the Erdös-Pósa Property
H-Representation of the Kimura-3 Polytope for the m-Claw Tree
Minimum Average Distance Clique Trees
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
Faces of Root Polytopes
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
Testing k-colorability
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
New Facets of the Linear Ordering Polytope
Multitasking Capacity: Hardness Results and Improved Constructions
Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids
A Tight Erdös-Pósa Function for Wheel Minors
The Equivariant Inverse Kazhdan-Lusztig Polynomials of Uniform Matroids
Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
The Highly Connected Even-Cycle and Even-Cut Matroids
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
On the Complexity of Finding a Sun in a Graph
Fair Division and Generalizations of Sperner- and KKM-type Results
On Lattices Generated by Finite Abelian Groups
Erratum for "On the Inequalities of Projected Volumes and the Constructible Region"
Limiting Distribution for the Depth in Patricia Tries
A Combinatorial Characterization of Coxeter Groups
Graph-Different Permutations
Augmenting Undirected Node-Connectivity by One
Sorting by Transpositions
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture
Peeling the Grid
Combinatorics of Polymer-Based Models of Early Metabolism
A Characterization of Almost CIS Graphs
Multiple Capacity Vehicle Routing on Paths
The Phase Transition in Multitype Binomial Random Graphs
On Cusick's Method and Value Sets of Certain Polynomials over Finite Fields
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path
A Bound on the Shannon Capacity via a Linear Programming Variation
Fourier Spectra of Binomial APN Functions
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs
Popular Matchings: Structure and Strategic Issues
Brillouin Zones of Integer Lattices and Their Perturbations
On Maximal Independent Arborescence Packing
On the Density of Nearly Regular Graphs with a Good Edge-Labeling
Bounded Stable Sets: Polytopes and Colorings
Quadratically Many Colorful Simplices
Minimum Transversals in Posimodular Systems
Limit Profile for the Transpose Top-2 with Random Shuffle
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
Labelling Cayley Graphs on Abelian Groups
Shatter Functions with Polynomial Growth Rates
Rainbow Even Cycles
A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm
Avoiding Patterns in Matrices Via a Small Number of Changes
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
BCH Codes with Minimum Distance Proportional to Code Length
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
Practical Approximation Algorithms for Zero- and Bounded-Skew Trees
On Two Problems in Ramsey-Turán Theory
Broadcast Transmission to Prioritizing Receivers
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case
Min-Max Relations for Odd Cycles in Planar Graphs
Graph Classes and Forbidden Patterns on Three Vertices
Uniquely Restricted Matchings in Interval Graphs
Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths
Bipartite Subgraphs of Triangle-Free Graphs
Short Encodings of Evolving Structures
A Fast Perfect-Matching Algorithm in Random Graphs
Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms
The Co-2-plex Polytope and Integral Systems
Constructive Bounds on Ordered Factorizations
Correlation of Boolean Functions and Pathology in Recursion Trees
Algorithms for Dualization over Products of Partially Ordered Sets
Roots of the Reliability Polynomial
On the Circuit Diameter of Dual Transportation Polyhedra
On the Carathéodory Number for the Convexity of Paths of Order Three
Real Number Channel Assignments for Lattices
Strong Immersions and Maximum Degree
Pair Labelings of Graphs
The Spectrum of Triangle-Free Graphs
Degree and Algebraic Properties of Lattice and Matrix Ideals
Time and Cost Trade-Offs in Gossiping
The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
Nontrivial t -Intersecting Families for Vector Spaces
Centers for Random Walks on Trees
On Perles' Configuration
A Polyhedral Frobenius Theorem with Applications to Integer Optimization
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
The Strong Chromatic Index of Random Graphs
Stabilization of Block-Type-Decodability Properties for Constrained Systems
List Coloring of Two Matroids through Reduction to Partition Matroids
The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs
A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
Hitting Forbidden Minors: Approximation and Kernelization
Convex-Round and Concave-Round Graphs
Domination on Cocomparability Graphs
On Ramsey Minimal Graphs
Errata: Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions
t-Perfection Is Always Strong for Claw-Free Graphs
Vertex Partitions into an Independent Set and a Forest with Each Component Small
Correlation of Graph-Theoretical Indices
Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
Group Connectivity in 3-Edge-Connected Signed Graphs
Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
Angles of Planar Triangular Graphs
Improper Choosability of Planar Graphs without 4-Cycles
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube
Dual Eulerian Properties of Plane Multigraphs
3-Colorable Subclasses of P 8 -Free Graphs
Asymptotic Study of Subcritical Graph Classes
The Order Dimension of Convex Polytopes
Planar Graphs without 7-Cycles Are 4-Choosable
Partition-Optimization with Schur Convex Sum Objective Functions
Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n))
Sparse Sourcewise and Pairwise Distance Preservers
The Capacitated K -Center Problem
On the Singularity of Random Combinatorial Matrices
On Connected Components with Many Edges
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs
Bell Inequalities, Grothendieck's Constant, and Root Two
Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor
Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts
On Existence of t-Designs with Large v and lambda
A Generalized Distance in Graphs and Centered Partitions
Cops and Robbers on Graphs of Bounded Diameter
SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph
On the Push&Pull Protocol for Rumor Spreading
Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria
Tropical Complexity, Sidon Sets, and Dynamic Programming
Submodularity Helps in Nash and Nonsymmetric Bargaining Games
On the Bias of Reed-Muller Codes over Odd Prime Fields
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
On-Line Vertex Ranking of Trees
Algorithms for Perfectly Contractile Graphs
Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds
Self-Similarity of Graphs
An Extension of the Blow-up Lemma to Arrangeable Graphs
The Effect of Adding Randomly Weighted Edges
Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
The Extremal Function for Excluding Geometry Minors over Prime Fields
Combinatorial Properties of a Rooted Graph Polynomial
An Ordering on the Even Discrete Torus
5-Connected Toroidal Graphs are Hamiltonian-Connected
Embedding into Bipartite Graphs
Bounds on the List-Decoding Radius of Reed-Solomon Codes
The α-Arboricity of Complete Uniform Hypergraphs
Turán Densities for Small Hypercubes
Notes on Hazard-Free Circuits
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems
Stirling Numbers for Complex Arguments: Asymptotics and Identities
A Lower Bound for Network Navigability
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of S n
Six New Classes of Permutation Trinomials over 픽 2 n
Dyadic Packing of Dijoins
The Linearity of First-Fit Coloring of Interval Graphs
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
On the 1.1 Edge-Coloring of Multigraphs
Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices
Turán Densities of Some Hypergraphs Related to K k+1 k
Transportation Distance between Probability Measures on the Infinite Regular Tree
Discrete Concavity and the Half-Plane Property
Packing Steiner Trees: Separation Algorithms
Short Rank-Metric Codes and Scattered Subspaces
A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
On Generalized Turán Results in Height Two Posets
A Combinatorial Interpretation of the Chebyshev Polynomials
Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs
When Does a Mixture of Products Contain a Product of Mixtures?
Sárközy's Theorem in Various Finite Field Settings
Correction to Edge-Bandwidth of Graphs
A Reciprocity on Finite Abelian Groups Involving Zero-Sum Sequences
Huge Unimodular n-Fold Programs
Pair Labeelings with Given Distance
The Complexity of Graph Pebbling
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
On the Metric Dimension of Cartesian Products of Graphs
Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters
Small Stretch Pairwise Spanners and Approximate D-Preservers
Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F 2 m , and Crosscorrelation of Maximum-Length Sequences
Refining a Tree-Decomposition which Distinguishes Tangles
A Note on Color-Bias Perfect Matchings in Hypergraphs
Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable
Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings
Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs
Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior
Split Hypergraphs
Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs
Induced Cycle Structures of the Hyperoctahedral Group
The Stripping Process Can be Slow: Part II
Full Color Theorems for L(2, 1)-Colorings
Planar Graphs Have Exponentially Many 3-Arboricities
Gaussian Elimination with Pivoting is P-Complete
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization
Extending Fractional Precolorings
The Divisors of x 2 m+x of Constant Derivatives and Degree 2 m -2
An Optimization Problem in Statistical Databases
Generalized Tuza's Conjecture for Random Hypergraphs
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs
t-Strong Cliques and the Degree-Diameter Problem
The Complexity of Deletion Problems for Matroids
On Security of Statistical Databases
Tropicalizing the Graph Profile of Some Almost-Stars
Randomized Pursuit-Evasion with Local Visibility
Optimal Rounding of Instantaneous Fractional Flows Over Time
Total Domination and Irredundance in Weighted Interval Graphs
A Forward Lower Restricted Ordering Algorithm for Digraphs
Large Induced Subgraphs with k Vertices of Almost Maximum Degree
To Approximate Treewidth, Use Treelength!
A Tropical Intersection Product in Matroidal Fans
Frameworks with Coordinated Edge Motions
Embedding de Bruijn and Schuffle-Exchange Graphs in Five Pages
Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game
Path Contraction Faster than 2 n
Cooperative Games under Augmenting Systems
Boundary \({\boldsymbol{H^\ast}}\) -Polynomials of Rational Polytopes
A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
Medians and Majorities in Semimodular Lattices
Hamilton Cycles in Random Digraphs with Minimum Degree at Least One
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity
When Do Gomory-Hu Subtrees Exist?
Antidirected Trees in Dense Digraphs
Inequalities on Projected Volumes
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
Partitions of A omega
On the Power of Threshold Circuits with Small Weights
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
The Ising Antiferromagnet and Max Cut on Random Regular Graphs
The Bar Visibility Number of a Graph
Embedding Spanning Trees in Random Graphs
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
Partial Shuffles by Lazy Swaps
Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs
Graphs that Split Entropies
New Ramsey Bounds from Cyclic Graphs of Prime Order
The \(s\)-Weak Order and \(s\)-Permutahedra I: Combinatorics and Lattice Structure
Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian
Steiner Trees and Convex Geometries
On Tight Cycles in Hypergraphs
Multivariable Codes Over Finite Chain Rings: Serial Codes
New Bounds for Equiangular Lines and Spherical Two-Distance Sets
Griggs and Yeh's Conjecture and L(p, 1)-labelings
Parameterized Counting and Cayley Graph Expanders
Small Examples of Nonconstructible Simplicial Balls and Spheres
The Median Procedure in a Formal Theory of Consensus
Optimal Interleaving on Tori
On 3-Hypergraphs with Forbidden 4-Vertex Configurations
Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
Defining a Phylogenetic Tree with the Minimum Number of r-State Characters
Fractional Packing of T-Joins
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains
Folder Complexes and Multiflow Combinatorial Dualities
Ramsey Equivalence for Asymmetric Pairs of Graphs
On the Complexity of MMSNP
An improved sum-product estimate for general finite fields
Random Hypergraph Irregularity
Forbidden Induced Subgraphs of Double-split Graphs
Coloring Random Intersection Graphs and Complex Networks
The Existence of N 2 Resolvable Latin Squares
Short Monadic Second Order Sentences about Sparse Random Graphs
Nonequivalent q -ary Perfect Codes
Sparse Spanning k-Connected Subgraphs in Tournaments
Approximation Algorithms for the k -Clique Covering Problem
Random Sequential Adsorption on Graphs
Monochromatic Partitions of Complete Uniform Hypergraphs
Oracle Tractability of Skew Bisubmodular Functions
Computing Minimal Triangulations in Time O ( n alpha log n ) = o ( n 2.376 )
Partitions with Restricted Block Sizes, Möbius Functions, and the k -of-Each Problem
Even Cycles in Directed Graphs
Finding Cycles with Topological Properties in Embedded Graphs
Generalized Chromatic Numbers of Random Graphs
Bounds on Maximum Weight Directed Cut
Analysis of a Recurrence Arising from a Construction for Nonblocking Networks
On Additive Doubling and Energy
Contrast Optimal Threshold Visual Cryptography Schemes
On the Homology of the h, k-Equal Dowling Lattice
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
Complexes of t-Colorable Graphs
Scattered Classes of Graphs
An Optimal Acceptance Policy for an Urn Scheme
On Lower Bounds for Selecting the Median
Avoiding 5-Circuits in 2-Factors of Cubic Graphs
Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
A Coxeter-Gram Classification of Positive Simply Laced Edge-Bipartite Graphs
Locating Servers for Reliability and Affine Embeddings
Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains
Graphs with χ=Δ Have Big Cliques
Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs
Invertibility of Digraphs and Tournaments
Rigidity of Frameworks Supported on Surfaces
Extension to Even Triangulations
Spectrum of Sizes for Perfect Deletion-Correcting Codes
Rumors Spread Slowly in a Small-World Spatial Network
Random Resource Allocation Graphs and the Probability of Deadlock
On 3-Colorable P 5 -Free Graphs
Bit Serial Multiplication in Finite Fields
Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering
Packing and Covering a Given Directed Graph in a Directed Graph
Distances between Realizations of Order Types
Complexes of Directed Graphs
Pairwise Disjoint Perfect Matchings in r -Edge-Connected r -Regular Graphs
The Profile Polytope of Nontrivial Intersecting Families
On the Shard Intersection Order of a Coxeter Group
Partitions and (m and n) Sums of Products - Two Cell Partition
The Independent Even Factor Problem
The Maximum Induced Bipartite Subgraph Problem with Edge Weights
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs
On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
Random Walks on Regular and Irregular Graphs
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection
The Size of a Graph Without Topological Complete Subgraphs
Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Reliability Applications
Testing Bandwidth k for k-Connected Graphs
The LBFS Structure and Recognition of Interval Graphs
Decomposition of Quaternary Signed-Graphic Matroids
Optimal Sets of Questions for Twenty Questions
Lehman's Theorem and the Directed Steiner Tree Problem
Rotor Walks on General Trees
A High Girth Graph Construction
Dickson Polynomials of the Second Kind that Permute Z m
Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph
Cayley Graphs with Neighbor Connectivity One
Constraint Satisfaction Problems on Intervals and Length
The Number of Intersection Points Made by the Diagonals of a Regular Polygon
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
Binary Cyclic Transversal Polytopes
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
Turán Numbers of Bipartite Subdivisions
A Constant Factor Approximation for Minimum λ -Edge-Connected k -Subgraph with Metric Costs
The Recognition Problem of Graph Search Trees
The Ring Loading Problem
Decomposition of Random Graphs into Complete Bipartite Graphs
Connectivity of Matching Graph of Hypercube
Exponential Sums with Sparse Polynomials over Finite Fields
Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints
On Mod (2s+1)-Orientations of Graphs
On the Nonmultiplicativity of Oriented Cycles
Dynamic TCP Acknowledgment: Penalizing Long Delays
An Edge-Colored Version of Dirac's Theorem
The Geodetic Hull Number is Hard for Chordal Graphs
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
On the Second Largest Component of Random Hyperbolic Graphs
A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
Tight Cycle Relaxations for the Cut Polytope
IIS-Hypergraphs
Computing Functions of a Shared Secret
Chip-Firing and Critical Groups of Signed Graphs
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms
Routing Permutations on Graphs Via Matchings
Structure and Coloring of Graphs with Only Small Odd Cycles
Graph Algorithms for Conformance Testing Using the Rural Chinese Postman Tour
Sums, Products, and Dilates on Sparse Graphs