yusuke1997/dblp-id-title huggingface dataset:
Exploiting the Arabic Wikipedia for semi-automatic construction of a lexical ontology
Reconciling faceted search and query languages for the Semantic Web
Assessment of classification and indexing of an agricultural journal based on metadata in AGRIS and CAB Abstracts databases
A semantic web enabled host intrusion detection system
Using ontology for resume annotation
Ontology-driven approach towards domain-specific system design
Towards a representation for multi-viewpoints ontology alignments
Universal Graphs for Bounded-Degree Trees and Planar Graphs
A Value for Games Restricted by Augmenting Systems
Matching Extendability in Hypercubes
Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
Packing Tight Hamilton Cycles in Uniform Hypergraphs
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains
Coloring Jordan Regions and Curves
On some Multicolor Ramsey Properties of Random Graphs
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
Frameproof Codes
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
Maker-Breaker Games on Randomly Perturbed Graphs
Total Acquisition in Graphs
The Excluded Minors for Isometric Realizability in the Plane
The Uniformity Conjecture in Additive Combinatorics
Adjacent Vertex Distinguishing Edge-Colorings
How to Secure Matchings against Edge Failures
A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
Nonextendible Latin Cuboids
A Study on r -Configurations - A Resource Assignment Problem on Graphs
A Complete Multipartite Basis for the Chromatic Symmetric Function
Hook-Valued Tableau Uncrowding and Tableau Switching
Monotonic Directed Designs
Recursive Solutions for the Generalized Erlang Queueing Systems
Domination, Fractional Domination, 2-Packing, and Graph Products
A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
Perfect Matchings in the Semirandom Graph Process
The Last Fraction of a Fractional Conjecture
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
Exchange Distance of Basis Pairs in Split Matroids
Planar Digraphs of Digirth Four are 2-Colorable
Chasing Tripods to Obtain a Rooted Subdivision
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs
Robust Matchings
Counting Claw-Free Cubic Graphs
Energy Minimization of Repelling Particles on a Toric Grid
An Upper Bound for Weak B k -Sets
On the Co-P 3 -Structure of Perfect Graphs
A q -Analogue of the Addressing Problem of Graphs by Graham and Pollak
Cop and Robber Games When the Robber Can Hide and Ride
A Robust Noncryptographic Protocol for Collective Coin Flipping
Parametrizing an Integer Linear Program by an Integer
Infinite Turán Problems for Bipartite Graphs
On Identifying Maximal Covers
The Special Function Field Sieve
Upward Topological Book Embeddings of DAGs
Odd Minimum Cut Sets and b-Matchings Revisited
Distributions of Sparse Spanning Subgraphs in Random Graphs
Resilient Pancyclicity of Random and Pseudorandom Graphs
A Chain Theorem for 3 + -Connected Graphs
The Extremal Number of the Subdivisions of the Complete Bipartite Graph
String Noninclusion Optimization Problems
Linear Time Split Decomposition Revisited
The Problem of Compatible Representatives
A Generalization of the Goresky-Klapper Conjecture, Part I
Spherical Designs via Brouwer Fixed Point Theorem
Tight Bounds on Minimum Broadcast Networks
Isoperimetric Inequalities and Eigenvalues
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
The Laplacian Spectrum of a Graph II
A Gray Code for Necklaces of Fixed Density
Disjoint Odd Cycles in Cubic Solid Bricks
Efficient Gossiping by Packets in Networks with Random Faults
Heroes in Orientations of Chordal Graphs
Circular Coloring the Plane
Gröbner Bases of Radical Li-Li Type Ideals Associated with Partitions
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
Labelling Graphs with a Condition at Distance 2
Acyclic Edge-Coloring of Planar Graphs: Δ Colors Suffice When Δ is Large
An Efficient Sparse Regularity Concept
Total Dual Integrality in Some Facility Location Problems
The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
Subgraphs of Weakly Quasi-Random Oriented Graphs
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs
Ramsey Numbers and the Size of Graphs
Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph
Proper Conflict-Free Coloring of Graphs with Large Maximum Degree
On Computing the Maximum Parsimony Score of a Phylogenetic Network
The Excess Degree of a Polytope
The Radon Transform on Z n
Improved Bounds for r-Identifying Codes of the Hex Grid
Perfect Matchings in Grid Graphs after Vertex Deletions
Crux and Long Cycles in Graphs
The Complexity of the Hajos Calculus
On Computing the Frequencies of Induced Subhypergraphs
On k-Term DNF with the Largest Number of Prime Implicants
The Lempel--Ziv Complexity of Fixed Points of Morphisms
Rankings of Graphs
Hamiltonian Cycles with Prescribed Edges in Hypercubes
An Explicit Construction of Lower-Diameter Cubic Graphs
Bounds for Codes Identifying Vertices in the Hexagonal Grid
Nonseparating Planar Chains in 4-Connected Graphs
A Recursive Construction For Regular Difference Triangle Sets
Uniqueness in Discrete Tomography: Three Remarks and a Corollary
The Existence of r × 4 Grid-Block Designs with r=3, 4
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
Adapting the Directed Grid Theorem into an FPT Algorithm
Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound
Girth, Pebbling, and Grid Thresholds
The Rigidity of Spherical Frameworks: Swapping Blocks and Holes
Every Monotone 3-Graph Property is Testable
A Bijection for Rooted Maps on Orientable Surfaces
Point-Polynomial Incidences Theorem with an Application to Reed-Solomon Codes
On Short Noncontractible Cycles in Embedded Graphs
An Interlacing Result on Normalized Laplacians
On the Fourier Spectra of New APN Functions
Almost Intersecting Families of Sets
Hanani-Tutte and Hierarchical Partial Planarity
Separation Dimension of Bounded Degree Graphs
A Semialgebraic Description of the General Markov Model on Phylogenetic Trees
On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice
On Optimal Depth Threshold Circuits for Multiplication and Related Problems
Combinatorial Expansions for Families of Noncommutative k-Schur Functions
On the Secrecy Gain of ℓ-Modular Lattices
The Channel Assignment Problem with Variable Weights
The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees
Planar Turán Number of the 6-Cycle
Revisiting Decomposition by Clique Separators
Dynamic Steiner Tree Problem
On Degree Sequences Forcing The Square of a Hamilton Cycle
Outerstring Graphs are χ-Bounded
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
Generating the Linear Extensions of Certain Posets by Transpositions
Representing Small Identically Self-Dual Matroids by Self-Dual Codes
Alexander Duality and Rational Associahedra
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
Generalized Alon--Boppana Theorems and Error-Correcting Codes
Fractional Coloring of Planar Graphs of Girth Five
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis
Polyhedral Properties of Clutter Amalgam
A Finite Family of Pseudodiscs Must Include a "Small" Pseudodisc
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
Edge-Injective and Edge-Surjective Vertex Labellings
Well-Covered Vector Spaces of Graphs
The Lattice Structure of Flow in Planar Graphs
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
On the Optimality of the FCC Lattice for Soft Sphere Packing
On the Representability of the Biuniform Matroid
Corrigendum: Orthogonal Tree-Decompositions of Graphs
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
On Disjoint Common Bases in Two Matroids
Almost Perfect Matchings in k-Partite k-Graphs
Singularity Analysis of Generating Functions
On the Game Chromatic Number of Sparse Random Graphs
Surjective Extensions of Sliding-Block Codes
Percolation on Random Graphs with a Fixed Degree Sequence
Majorization and Minimal Energy on Spheres
The Erdös-Hajnal Conjecture for Long Holes and Antiholes
Comparing Top k Lists
Analysis of Algorithms for Listing Equivalence Classes of k -ary Strings
On the Integrality of Some Facility Location Polytopes
The Incidence Hopf Algebra of Graphs
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
Tropical Fermat-Weber Points
Kissing Polytopes
An Algebraic Proof of the Dichotomy for Graph Orientation Problems with Forbidden Tournaments
Deletion Formulas for Equivariant Kazhdan-Lusztig Polynomials of Matroids
Minimizing the Number of Carries in Addition
Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs
On Error-Correcting Codes and Invariant Linear Forms
Weak Three-Linking in Eulerian Digraphs
When Does a Curve Bound a Distorted Disk?
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
A Combinatorial Approach to Biorthogonal Polynomials
A Spectral Erdős-Sós Theorem
Counting Embeddings of Planar Graphs Using DFS Trees
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions
Rainbow Odd Cycles
Hitting Times for Random Walks with Restarts
Complete Minors and Independence Number
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs
Real Number Graph Labellings with Distance Conditions
Forcing Large Complete (Topological) Minors in Infinite Graphs
The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs
The Minimum Distance of Some Narrow-Sense Primitive BCH Codes
Corrigendum: Orthogonal Tree Decompositions of Graphs
Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem
A Construction of Infinite Sets of Intertwines for Pairs of Matroids
6-Critical Graphs on the Klein Bottle
On the Position Value for Communication Situations
On the Size of Weights for Threshold Gates
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
A Randomness-Rounds Tradeoff in Private Computation
On the Weisfeiler-Leman Dimension of Permutation Graphs
Lattice-Width Directions and Minkowski's 3 d -Theorem
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
Color-Bias Perfect Matchings in Hypergraphs
Constructive Packings of Triple Systems
Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
Feasible Offset and Optimal Offset for General Single-Layer Channel Routing
New Constructions and Bounds for Winkler's Hat Game
Uniqueness of Vertex Magic Constants
Repeated Minimizers of p-Frame Energies
Shared Ancestry Graphs and Symbolic Arboreal Maps
Immersions in Highly Edge Connected Graphs
A Greedy Algorithm Estimating the Height of Random Trees
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk
Near-Universal Cycles for Subsets Exist
Dimension of Projections in Boolean Functions
Normal and Self-dual Normal Bases from Factorization of c x q+1 + d x q - ax - b
Blocking Semiovals of Type (1, m+1, n+1)
Rainbow Erdös-Rothschild Problem for the Fano Plane
An Extremal Problem on Sparse 0-1 Matrices
Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations
On Treewidth and Related Parameters of Random Geometric Graphs
h-Polynomials of Reduction Trees
Nowhere-Zero 3-Flows in Signed Graphs
Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman Problem
Vertex Types in Book-Embeddings
On the Stability of the Graph Independence Number
On Book Crossing Numbers of the Complete Graph
Coloring Powers and Girth
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding
Graphs Having Small Number of Sizes on Induced k-Subgraphs
Order-Isomorphic Twins in Permutations
Constant Congestion Brambles in Directed Graphs
Steiner Distance-Hereditary Graphs
Rigidity of Balanced Minimal Cycle Complexes
The Catalan Case of Armstrong's Conjecture on Simultaneous Core Partitions
Minimizing the Number of Edges in K (s, t) -Saturated Bipartite Graphs
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
Refinement on Spectral Turán's Theorem
Parity-Unimodality and a Cyclic Sieving Phenomenon for Necklaces
A Proof of Brouwer's Toughness Conjecture
Chromatic Roots and Minor-Closed Families of Graphs
Acute Sets In Euclidean Spaces
Combinatorial Algorithm for a Lower Bound on Frame Rigidity
Collective tree spanners of graphs
A Characterization of Projective Unitary Equivalence of Finite Frames and Applications
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
The Length of a Leaf Coloration on a Random Binary Tree
Random Graphs with a Fixed Maximum Degree
Leaf Pairs and Tree Dissections
HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank
The Size Ramsey Number of Graphs with Bounded Treewidth
Permutation Trinomials Over Finite Fields with Even Characteristic
Thomassen's Choosability Argument Revisited
The Number of Edges in k-Quasi-planar Graphs
Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs
Repeated Patterns in Proper Colorings
Shortest Paths in the Tower of Hanoi Graph and Finite Automata
Spanning Trees with Few Branch Vertices
A Subgroup of the Full Poset-Isometry Group
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion
Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
An Upper Bound on the Sizes of Multiset-Union-Free Families
Algorithmic Aspects of Neighborhood Numbers
Unified Greedy Approximability beyond Submodular Maximization
Graphs with Two Crossings Are 5-Choosable
Lattice Point Inequalities for Centered Convex Bodies
On the Ramsey-Turán Problem for 4-Cliques
Completely Disconnecting the Complete Graph
A Conjecture of Verstraëte on Vertex-Disjoint Cycles
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem
A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
On Reconstructing Graphs and Their Complements
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading
Periodic Body-and-Bar Frameworks
A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
The Determination of the Chain Good Weight Hierarchies with High Dimension
Comparing Queues and Stacks as Mechanisms for Laying out Graphs
On a Conjecture of Nagy on Extremal Densities
Adapted List Coloring of Graphs and Hypergraphs
MacWilliams Identities for m-tuple Weight Enumerators
On Circuits and Serial Symmetric Basis-Exchange in Matroids
Approximation Algorithms for Stochastic and Risk-Averse Optimization
Strong Chordality of Graphs with Possible Loops
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices
Some Results on Chromatic Number as a Function of Triangle Count
Crossings and Nestings of Two Edges in Set Partitions
Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
An Exact Result for Hypergraphs and Upper Bounds for the Tur[a-acute]n Density of K r r+1
Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems
Ollivier-Ricci Idleness Functions of Graphs
Repeated Degrees in Random Uniform Hypergraphs
Cop and Robber Game and Hyperbolicity
\(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
Clique r -Domination and Clique r -Packing Problems on Dually Chordal Graphs
An Invariant for Hypersurfaces in Prime Characteristic
On the Random Greedy F-Free Hypergraph Process
On the Power of Democratic Networks
Binary Probabilities Induced by Rankings
On Convex Subsets in Tournaments
Degree-Constrained Network Spanners with Nonconstant Delay
Classes of Graphs that Are Not Vertex Ramsey
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees
Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
On Induced Paths, Holes, and Trees in Random Graphs
Phase Transitions of Structured Codes of Graphs
Counting Coprime Pairs in Random Squares
Bergman Complexes of Lattice Path Matroids
M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
A Weak Version of Rota's Bases Conjecture for Odd Dimensions
Generalized Power Domination in Regular Graphs
A Matroid Extension Result
Ramanujan Diagrams
An Arbitrary Starting Homotopy-Like Simplicial Algorithm for Computing an Integer Point in a Class of Polytopes
Computing Weighted Strength and Applications to Partitioning
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
Data Security Equals Graph Connectivity
Fourier Analysis of a Class of Finite Radon Transforms
Multidimensional Manhattan Street Networks
On Product Schur Triples in the Integers
Probability Mass of Rademacher Sums Beyond One Standard Deviation
Dynamic Balanced Graph Partitioning
The Voronoi Region of E * 7
Power Domination in Product Graphs
The Algebraic Method in Tree Percolation
On the Strong Chromatic Number of Graphs
Facets of the Weak Order Polytope Derived from the Induced Partition Projection
No Laplacian Perfect State Transfer in Trees
The Automorphism Group of a Johnson Graph
Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
Steiner Triple Systems without Parallel Classes
Cubic Graphs with Given Circular Chromatic Index
Exchange Properties of Finite Set-Systems
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles
Solving the Maximum Popular Matching Problem with Matroid Constraints
The Symmetry of Littlewood-Richardson Coefficients: A New Hive Model Involutory Bijection
The Union of Matroids and the Rigidity of Frameworks
Nowhere-Zero Flows in Signed Series-Parallel Graphs
Fault-Tolerant Fixed Routings in Some Families of Digraphs
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
On Mubayi's Conjecture and Conditionally Intersecting Sets
Perfect Matching Index versus Circular Flow Number of a Cubic Graph
Bootstrap Percolation, the Schröder Numbers, and the N -Kings Problem
Ihara Zeta Functions of Infinite Weighted Graphs
On Torsor Structures on Spanning Trees
On the Structure of Graphs with Non-Surjective L(2, 1)-Labelings
Root Polytopes and Growth Series of Root Lattices
Intertwining Connectivities for Vertex-Minors and Pivot-Minors
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees
An Algebraic Framework for Discrete Tomography: Revealing the Structure of Dependencies
Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable
Autocorrelation and Distinctness of Decimations of l-Sequences
Algorithm for the CSR Expansion of Max-Plus Matrices Using the Characteristic Polynomial
Hypercubes and Multicommodity Flows
Approximating Width Parameters of Hypergraphs with Excluded Minors
Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five
A Random Triadic Process
Semikernels and ( k, l )-Kernels in Digraphs
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
\(\mathcal{P}\)-Matchings Parameterized by Treewidth
Embedding k -Outerplanar Graphs into l 1
Induced Matchings in Graphs of Bounded Maximum Degree
Tournament Ranking with Expected Profit in Polynomial Time
Bridging Separations in Matroids
Coloring Bull-Free Perfectly Contractile Graphs
On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices
Determinants and Longest Cycles of Graphs
Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture
On the Length of Directed Paths in Digraphs
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
The Order Dimension of Planar Maps
The Structure and Number of Obstructions to Treewidth
What Costs Are Minimized by Huffman Trees?
Realizing Interval Graphs with Size and Distance Constraints
Bounding the Number of Edges of Matchstick Graphs
A Min-Max Theorem for Transversal Submodular Functions and Its Implications
Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
List-Coloring Squares of Sparse Subcubic Graphs
Self-Complementary Normal Bases in Finite Fields
Search Problems in the Decision Tree Model
Optimal Packings of Hamilton Cycles in Sparse Random Graphs
Treewidth, Circle Graphs, and Circular Drawings
Trimming Forests Is Hard (Unless They Are Made of Stars)
Lengths of Attractors and Transients in Neuronal Networks with Random Connectivities
More Constructive Lower Bounds on Classical Ramsey Numbers
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs
Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
Parsimonious Multigraphs
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
Cubic Monomial Bent Functions: A Subclass of M
Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
On Solving Rational Congruences
The Complexity of the Extendibility Problem for Finite Posets
Sensitivity of Mixing Times in Eulerian Digraphs
Diametral Pairs of Linear Extensions
Hypercubes As Direct Products
Dual Toric Codes and Polytopes of Degree One
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
2-Modular Matrices
Hamilton Cycles in Random Lifts of Directed Graphs
On the Number of Hamilton Cycles in Sparse Random Graphs
Cyclically Consecutive Permutation Avoidance
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
Marked Graphs and the Chromatic Symmetric Function
Target Set Selection Problem for Honeycomb Networks
Phase Transition of Degenerate Turán Problems in \({p}\)-Norms
An Algorithmic Regularity Lemma for L p Regular Sparse Matrices
Regular Graphs with Few Longest Cycles
Representation of Large Matchings in Bipartite Graphs
Determinant: Old Algorithms, New Insights
The Generalized Rainbow Turán Problem for Cycles
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions
On Playing Golf with Two Balls
Hamiltonian Spider Intersection Graphs Are Cycle Extendable
A Combinatorial Approach to Colourful Simplicial Depth
Almost Partitioning a 3-Edge-Colored K n, n into Five Monochromatic Cycles
Hajós-Type Constructions and Neighborhood Complexes
Lattice-Simplex Coverings and the 84-Shape
Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three
The Structure of Random Graph Orders
On New Sum-Product-Type Estimates
On Systematic Codes Obtained from Linear Codes Over GF(q 2 )
On the Duals of Binary Hyper-Kloosterman Codes