yusuke1997/dblp-id-title huggingface dataset:
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs
Congestion-free Optimal Routings of Hypercube Automorphisms
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing
A Computational Method for Bounding the Probability of Reconstruction on Trees
Extremal Problem for Matchings and Rainbow Matchings on Direct Products
On Some Polynomials Related to Weight Enumerators of Linear Codes
Supermodular Extension of Vizing's Edge-Coloring Theorem
Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs
The Graphs with All Subgraphs T-Perfect
On Equitable Coloring of d-Degenerate Graphs
Edge Conflicts do not Determine Geodesics in the Associahedron
Deciding Parity of Graph Crossing Number
Eulerian Self-Dual Codes
The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus
A Convex Quadratic Characterization of the Lovász Theta Number
Detachments Preserving Local Edge-Connectivity of Graphs
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
On the Gap Between Hereditary Discrepancy and the Determinant Lower Bound
Lower Bounds on the Probability of a Finite Union of Events
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
A Construction for ( t, m, s )-nets in Base q
Limit Behavior of Locally Consistent Constraint Satisfaction Problems
On Stability, Error Correction, and Noise Compensation in Discrete Tomography
Cut Dominants and Forbidden Minors
Saturation Problems about Forbidden 0-1 Submatrices
The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes
Global Price Updates Help
Scheduling Unrelated Machines by Randomized Rounding
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces
A Note on Seminormality of Cut Polytopes
Approximate Integer Decompositions for Undirected Network Design Problems
Formal Theory of Noisy Sensor Network Localization
Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
Maximum and Minimum Degree Conditions for Embedding Trees
On the Trellis Complexity of the Densest Lattice Packings in R n
Finding and Using Expanders in Locally Sparse Graphs
Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions
Complementary Iterated Floor Words and the Flora Game
Navigating in a Graph by Aid of Its Spanning Tree Metric
Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist
Neighbor Systems and the Greedy Algorithm
Proof of the Goresky Klapper Conjecture on Decimations of L-sequences
Lower Bounds on Geometric Ramsey Functions
Constructions for Cyclic Sieving Phenomena
An Improved Sum-Product Bound for Quaternions
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis
Plane Permutations and Applications to a Result of Zagier-Stanley and Distances of Permutations
The Domatic Number Problem in Interval Graphs
Disks on a Tree: Analysis of a Combinatorial Game
Voting Paths
Spanning Directed Trees with Many Leaves
Cohen-Macaulay Rings in Network Reliability
The Expected Capacity of Concentrators
Graph Ear Decompositions and Graph Embeddings
Lattice Size of Plane Convex Bodies
The Codegree Threshold for 3-Graphs with Independent Neighborhoods
Going Far from Degeneracy
Triangulating 3-Colored Graphs
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
On the Codegree Density of PG m(q)
Symmetry Matters for Sizes of Extended Formulations
The Cycle Construction
Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
Clean Clutters and Dyadic Fractional Packings
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
Flips in Graphs
A Lower Bound for the Complexity of Monotone Graph Properties
Nested Recurrence Relations with Conolly-like Solutions
On the Irregularity Strength of Dense Graphs
Refined List Version of Hadwiger's Conjecture
Two Trees Are Better than One
Labeled Ballot Paths and the Springer Numbers
On the Stable Paths Problem
On the General Position Subset Selection Problem
A Property on Monochromatic Copies of Graphs Containing a Triangle
Families of Graph-different Hamilton Paths
Orthogonal Tree Decompositions of Graphs
Cyclic Matroids
Relative Turán Problems for Uniform Hypergraphs
Ramsey Numbers for Nontrivial Berge Cycles
Fractional colorings of cubic graphs with large girth
On the 3-Terminal Cut Polyhedron
Positivity of Iterated Sequences of Polynomials
The k-Edge-Connected Spanning Subgraph Polyhedron
Random Necklaces Require Fewer Cuts
Replicating Tessellations
On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
Geometry of the Minimal Solutions of a Linear Diophantine Equation
Optimal (9 v , 4, 1) Optical Orthogonal Codes
Boolean Normal Forms, Shellability, and Reliability Computations
Hamiltonicity of Random Graphs in the Stochastic Block Model
Projections of Binary Linear Codes onto Larger Fields
Hadwiger's Conjecture for Graphs with Forbidden Holes
An Almost Linear Time Algorithm for Generalized Matrix Searching
Sparse Graphs of High Gonality
Cyclic Inclusion-Exclusion
Beyond the Vizing's Bound for at Most Seven Colors
Polynomial Bound for a Chip Firing Game on Graphs
Lattice 3-Polytopes with Few Lattice Points
The Two-Coloring Number and Degenerate Colorings of Planar Graphs
On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
An Inequality for Probability Moments with Applications
Circularly Compatible Ones, D-Circularity, and Proper Circular-Arc Bigraphs
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint k-Cliques (and This Is Tight)
Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ 2
Optimal Distance Labeling for Interval Graphs and Related Graph Families
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree
Computing the Bandwidth of Interval Graphs
On-line Ramsey Numbers
On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem
On Isoperimetric Connectivity in Vertex-Transitive Graphs
On the Pagenumber of k-Trees
Constant Weight Conflict-Avoiding Codes
Unavoidable Connected Matroids Retaining a Specified Minor
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
Factors with Multiple Degree Constraints in Graphs
Sharp Threshold for Hamiltonicity of Random Geometric Graphs
On the Optimality of General Lower Bounds for Broadcasting and Gossiping
Computing Optimal Morse Matchings
The Treewidth and Pathwidth of Graph Unions
Labeling Planar Graphs with Conditions on Girth and Distance Two
Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
Unavoidable Induced Subgraphs in Graphs with Complete Bipartite Induced Minors
Compact Cylindrical Chromatic Scheduling
Optimal Cycle Codes Constructed From Ramanujan Graphs
Splitting Multidimensional Necklaces and Measurable Colorings of Euclidean Spaces
Automorphisms of Projective Spaces and Min-Wise Independent Sets of Permutations
t-Wise Berge and t-Heavy Hypergraphs
Understanding Popular Matchings via Stable Matchings
On the Distribution of Lengths of Evolutionary Trees
On Reverse-Free Codes and Permutations
A Characterization of K 2, 4 -Minor-Free Graphs
Convex Characters, Algorithms, and Matchings
Matchings and Nonrainbow Colorings
Quiet Planting in the Locked Constraint Satisfaction Problems
How to Choose the Best Twins
The Erdös-Falconer Distance Problem on the Unit Sphere in Vector Spaces Over Finite Fields
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem
Barker Arrays I: Even Number of Elements
On Forbidden Configurations in Point-Line Incidence Graphs
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces
On Perfect Codes and Tilings: Problems and Solutions
Recognition of Tree Metrics
A Primal Barvinok Algorithm Based on Irrational Decompositions
Bonds Intersecting Long Paths in \(k\) -Connected Graphs
A Quantitative Helly-Type Theorem: Containment in a Homothet
The Tuza-Vestergaard Theorem
On the Maximum Density of Graphs with Unique-Path Labelings
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
Recognizing Powers of Proper Interval, Split, and Chordal Graph
Self-Dual Maps I: Antipodality
Parallel Algorithms for Zero-One Supply-Demand Problems
On a Problem of Nathanson Related to Minimal Additive Complements
Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
Distributive Lattices Defined for Representations of Rank Two Semisimple Lie Algebras
On Four-Variable Expanders in Finite Fields
Asymptotic Analysis of some Network Reliability Models
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
Three-Dimensional Periodicity and Its Application to Pattern Matching
Bishellable drawings of K n
Steiner Trees for Terminals Constrained to Curves
A Note on Large H-Intersecting Families
On Pósa's Conjecture for Random Graphs
Trace of Products in Finite Fields from a Combinatorial Point of View
The Cover Time of Random Regular Graphs
Graphs from Generalized Kac-Moody Algebras
A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version
Nearly Perfect Matchings in Uniform Hypergraphs
On the Combinatorial Diameters of Parallel and Series Connections
Additive Decompositions of Subgroups of Finite Fields
Strong T-Perfection of Bad-K 4 -Free Graphs
Asymptotic Minimum Covering Radius of Block Codes
The Two-Batch Liar Game over an Arbitrary Channel
Completing and Extending Shellings of Vertex Decomposable Complexes
Constructing Finite Field Extensions with Large Order Elements
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
Extremal Problems for Roman Domination
Network-Based Vertex Dissolution
Matching of Given Sizes in Hypergraphs
A Precise Threshold for Quasi-Ramsey Numbers
On Local Versus Global Satisfiability
Counting Blanks in Polygonal Arrangements
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
Rapid Mixing and Markov Bases
An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism
A Proof of the 3/4-Conjecture for the Total Domination Game
Computational Complexity of Minimal Trap Spaces in Boolean Networks
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
A Topologically Complete Theory of Weaving
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights
On Graphs Having No Chromatic Zeros in (1, 2)
Forbidden Tournaments and the Orientation Completion Problem
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
Chains in the Noncrossing Partition Lattice
The Probabilistic Communication Complexity of Set Intersection
Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time
Long Local Searches for Maximal Bipartite Subgraphs
Erdös-Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields
Monochromatic Paths and Triangulated Graphs
Stanley's Lemma and Multiple Theta Functions
A Minimax Arc Theorem for Reducible Flow Graphs
On The Chromatic Number of Geometric Hypergraphs
More Patterns in Trees: Up and Down, Young and Old, Odd and Even
Maximum Weight Codewords of a Linear Rank-Metric Code
On the Vanishing of Discrete Singular Cubical Homology for Graphs
5-Coloring Graphs with 4 Crossings
Systematic Authentication Codes Based on a Class of Bent Functions and the Gray Map on a Galois Ring
Exact Formulas for Multitype Run Statistic in a Random Ordering
When is Individual Testing Optimal for Nonadaptive Group Testing?
Turán Graphs and the Number of Colorings
Number Theoretic Designs for Directed Regular Graphs of Small Diameter
Triangulating Vertex-Colored Graphs
Off-Diagonal Commonality of Graphs via Entropy
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
Disjoint Paths in a Planar Graph - A General Theorem
On Vietoris-Rips Complexes (with Scale 3) of Hypercube Graphs
An Improved Bound for the Rigidity of Linearly Constrained Frameworks
Neural Networks, Acyclic Orientations of the Hypercube, and Sets of Orthogonal Vectors
On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
An Entropic Proof of Chang's Inequality
A Formal Theory of Consensus
Angle-Restricted Sets and Zero-Free Regions for the Permanent
Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph
Combinatorial Constructions for Optimal Splitting Authentication Codes
Optimal Detection of Two Defectives with a Parity Check Device
Equidistributions around Special Kinds of Descents and Excedances
Enumeration of 2-Polymatroids on up to Seven Elements
Letter Graphs and Geometric Grid Classes of Permutations
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
Cayley Digraphs of Finite Abelian Groups and Monomial Ideals
Shellings and Sheddings Induced by Collapses
Bounding the Fractional Chromatic Number of K Delta -Free Graphs
The Tropical Critical Points of an Affine Matroid
Finding a Domatic Partition of an Interval Graph in Time O(n)
The Maximal Running Time of Hypergraph Bootstrap Percolation
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components
A Theory of Proportional Representation
Dense Induced Subgraphs of Dense Bipartite Graphs
Certain Occupancy Numbers via an Algorithm for Computing Their Ratios
A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
On the Size of Lattice Simplices with a Single Interior Lattice Point
A Ramsey-Type Theorem for Orderings of a Graph
Geometric Realization of Möbius Triangulations
Approximate Min-Power Strong Connectivity
Packing Triangles in Weighted Graphs
A Menger-Type Theorem for Two Induced Paths
Sum of Squares Certificates for Containment of H -Polytopes in V -Polytopes
Salvage-Embeddings of Complete Trees
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
Extremal Problems for Hypergraph Blowups of Trees
Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs
Efficiency of Local Search with Multiple Local Optima
Product Construction of Affine Codes
Fractals for Kernelization Lower Bounds
Better Approximation Guarantees for Job-Shop Scheduling
Cycle Saturation in Random Graphs
Growing Without Cloning
A Large Gap in a Dilate of a Set
The Size of the Largest Components in Random Planar Maps
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
Maximizing the Number of Nonnegative Subsets
A Simple Gray Code to List All Minimal Signed Binary Representations
Flooding in Weighted Sparse Random Graphs
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable
Near-Unanimity Polymorphisms on Structures with Finite Duality
An Upper Bound for the Hales-Jewett Number $\mathrm{HJ}(4, 2)$
Finite Field Kakeya and Nikodym Sets in Three Dimensions
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
On the Tree Packing Conjecture
Linear Extension Diameter of Downset Lattices of Two-Dimensional Posets
Large Deviation Theorem for Branches of the Random Binary Tree in the Horton-Strahler Analysis
Transversals of Longest Paths and Cycles
Convexity and HHD-Free Graphs
Cycles Intersecting Edge-Cuts of Prescribed Sizes
Cycle Decompositions of K n,n -I
Computing the Girth of a Planar Graph in O(n logn) Time
Two Conjectures in Ramsey-Turán Theory
Super Arrovian Domains with Strict Preferences
On the Maximum Induced Density of Directed Stars and Related Problems
Decomposing Random Permutations into Order-Isomorphic Subpermutations
Bounding the Optimal Rate of the ICSI and ICCSI problem
Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem
Creating Small Subgraphs in Achlioptas Processes With Growing Parameter
Flooding Time of Edge-Markovian Evolving Graphs
Constructing Small Sample Spaces Satisfying Given Constraints
A Zero-One Law for Boolean Privacy
Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint
A Strengthening on Odd Cycles in Graphs of Given Chromatic Number
Large Area Convex Holes in Random Point Sets
Interlocked Permutations
On Discrete LOG-Brunn-Minkowski Type Inequalities
Combinatorics and Genus of Tropical Intersections and Ehrhart Theory
Radius Three Trees in Graphs with Large Chromatic Number
Recognition of C 4 -Free and 1/2-Hyperbolic Graphs
An 0(n log n) Algorithm for Bandwidth of Interval Graphs
Normal 0-1 Polytopes
Strong Transversals in Hypergraphs and Double Total Domination in Graphs
Almost Every Randomly Near-Traceable Graph Has Diameter at Most Two
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
Constructing a Maximal Independent Set in Parallel
Set Systems with No Singleton Intersection
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
Simplicial Complexes Obtained from Qualitative Probability Orders
A Note on Bandits with a Twist
Improved p -ary Codes and Sequence Families from Galois Rings of Characteristic p 2
Reductions of Young Tableau Bijections
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
The Radon Transform on n k ast
A Simple Path to Component Sizes in Critical Random Graphs
Efficient Algorithms for Eulerian Extension and Rural Postman
Independent Sets in Discrete Tori of Odd Sidelength
Some Results on Liu's Conjecture
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition
The Poset of Proper Divisibility
On Regular Graphs Optimally Labeled with a Condition at Distance Two
Integer Representations of Convex Polygon Intersection Graphs
Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
Boundary Length of Reconstructions in Discrete Tomography
Transforming Triangulations on Nonplanar Surfaces
Bounding Connected Tree-Width
Variations on the Sum-Product Problem II
Hat Guessing Numbers of Strongly Degenerate Graphs
Turán Problems and Shadows III: Expansions of Graphs
Disjoint Chorded Cycles of the Same Length
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs
A Note on the Erdös Distinct Subset Sums Problem
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms
Toric Surface Codes and Minkowski Length of Polygons
Combinatorics for General Kinetically Constrained Spin Models
On the Use of the Klein Quadric for Geometric Incidence Problems in Two Dimensions
The Phase Transition of Discrepancy in Random Hypergraphs
Unavoidable Induced Subgraphs of Large 2-Connected Graphs
Tverberg Partition Graphs
Distribution of Distances in Five Dimensions and Related Problems
Number of Hamiltonian Cycles in Planar Triangulations
Arithmetic of Marked Order Polytopes, Monotone Triangle Reciprocity, and Partial Colorings
Valuated Matroid Intersection I: Optimality Criteria
The Total Interval Number of a Graph II: Trees and Complexity
Induced Matchings in Subcubic Graphs
2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles
Valid Plane Trees: Combinatorial Models for RNA Secondary Structures with Watson-Crick Base Pairs
Prime Testing for the Split Decomposition of a Graph
An Asymptotic Multipartite Kühn-Osthus Theorem
A Spacial Gradient Estimate for Solutions to the Heat Equation on Graphs
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection
Poincaré Polynomials of Odd Diagram Classes
Cutwidth of Split Graphs and Threshold Graphs
Representing Partitions on Trees
Robinson-Schensted-Knuth Algorithm, Jeu de Taquin, and Kerov-Vershik Measures on Infinite Tableaux
Statistical Inference for Internal Network Reliability with Spatial Dependence
On a Question of Erdös and Faudree on the Size Ramsey Numbers
Random Krylov Spaces over Finite Fields
The Minor Crossing Number
On Online Labeling with Large Label Set
Relationships between Pairs of Representations of Signed Binary Matroids
Forbidden k-Sets in the Plane
A Tight Bound on the Irregularity Strength of Graphs
Re-embeddings of Maximum 1-Planar Graphs
Phase Transitions for the Minimizers of the \(p\)-Frame Potentials in \(\mathbb{R}^{2}\)
Islands in Graphs on Surfaces
The Nonapproximability of Non-Boolean Predicates
Erdös-Pósa from Ball Packing
Doubly Exponentially Many Ingleton Matroids
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1
Extension to 3-Colorable Triangulations
Codes from Symmetry Groups, and a [32, 17, 8] Code
On the Weight of Halfspaces over Hamming Balls
Generating Permutations with k -Differences
Large Book-Cycle Ramsey Numbers
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
Enumeration of Concrete Regular Covering Projections
New Bounds On Covering Radius as a Function of Dual Distance
Midpoints of Diagonals of Convex n -GONS
On Approximating the Achromatic Number
Edge-Face Total Chromatic Number of Halin Graphs
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts
Sorting, Approximate Sorting, and Searching in Rounds
Quasi-Cyclic Subcodes of Cyclic Codes
Rank-Based Attachment Leads to Power Law Graphs
Finding Independent Sets in Triangle-free Graphs
Isolating Highly Connected Induced Subgraphs
Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
Counting and Detecting Small Subgraphs via Equations
Superlinear Integrality Gaps for the Minimum Majority Problem
Constructing Constant Composition Codes via Distance-Increasing Mappings
Further Results on T-Coloring and Frequency Assignment Problems
Codimension Two and Three Kneser Transversals
Representations of Planar Graphs
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
The Multistate Hard Core Model on a Regular Tree
Bounds on Equiangular Lines and on Related Spherical Codes
The L(2, 1)-Labeling Problem on Graphs
Rainbow Bases in Matroids
A New Upper Bound for the Irregularity Strength of Graphs
Hereditary Discrepancies in Different Numbers of Colors II
Vertex-Pursuit in Random Directed Acyclic Graphs
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
Quick Gossiping by Conference Calls
Obstructions For 2-Möbius Band Embedding Extension Problem
Hamiltonian Properties of Grid Graphs
Noncrossing Subgraphs in Topological Layouts
Dichotomy Results on the Hardness of H-free Edge Modification Problems
Sufficient Conditions for Graphicality of Bidegree Sequences
The Vector Space over GF(2) Generated by the Common Bases of Two Binary Matroids
On the Number of Perfect Matchings in a Bipartite Graph