yusuke1997/dblp-id-title huggingface dataset:
A necessary condition for the equality of the clique number and the convexity number of a graph
Generalizing D-graphs
The satisfactory partition problem
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
La queste del saint Gr a (AL): A computational approach to local algebra
Page cuts for integer interval linear programming
Parameterized complexity of locally minimal defensive alliances
Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2×n rectangles
Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
Searching expenditure and interval graphs
On the resilience of canonical reducible permutation graphs
LP-relaxations for tree augmentation
Hypergraph decomposition and secret sharing
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Remarks on restricted fractional (g,f)-factors in graphs
Scheduling Dyadic Intervals
On the security number of the Cartesian product of graphs
Implicit degree condition for hamiltonicity of 2-heavy graphs
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Factors of bi-regular bipartite graphs
A depth-first search algorithm for computing pseudo-closed sets
On error-tolerant DNA screening
A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture
Perfect graphs with polynomially computable kernels
SAT problems with chains of dependent variables
Approximate constrained bipartite edge coloring
Cryptographic properties of the hidden weighted bit function
Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs
The median of Sierpiński graphs
A linear-time algorithm for testing full outer-2-planarity
Quasi-threshold Graphs
On minimally 2-T-connected directed graphs
2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
Hamiltonicity of locally hamiltonian and locally traceable graphs
A Linear Algorithm for the Group Path Problem on Chordal Graphs
The quadratic M-convexity testing problem
Ameso optimization: A relaxation of discrete midpoint convexity
Maximizing the strong triadic closure in split graphs and proper interval graphs
Spreading in graphs
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
Jordan canonical form of Pascal-type matrices via sequences of binomial type
Erratum: Constrained Partitioning Problems
Comparison of mean distance in superposed networks
Optimal ordering of independent tests with precedence constraints
Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs
Edge-pancyclicity of coupled graphs
The Disjunctivities of w-languages
More powerful energetic reasoning for the cumulative scheduling problem
Some aspects of the semi-perfect elimination
Bandwidth and topological bandwidth of graphs with few P4's
New potential functions for greedy independence and coloring
A Note on Graphs with Large Girth, Small Minus Domination Number
Graph metric with no proper inclusion between lines
Forcing matching numbers of fullerene graphs
Computation of the center and diameter of outerplanar graphs
On the bicycle problem
Extremal Halin graphs with respect to the signless Laplacian spectra
Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
Maximum Laplacian energy of unicyclic graphs
A rounding algorithm for integer programs
Window queries for intersecting objects, maximal points and approximations using coresets
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
Factorization and pseudofactorization of weighted graphs
Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
The Turán number for spanning linear forests
Semidefinite Programming Relaxations for the Graph Partitioning Problem
Structure of cycles in minimal strong digraphs
A note on the depth function of combinatorial optimization problems
Fractional weak discrepancy and interval orders
The weighted vertex PI index of tricyclic graphs
Nonexistence of certain types of plateaued functions
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
Efficient construction of broadcast graphs
Short proof of a discrete gronwall inequality
Coloring copoints of a planar point set
Partitioning chordal graphs into independent sets and cliques
Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT
Irreducible disjoint covering systems (with an application to boolean algebra)
Combinatorial designs and cellular automata: A survey
Computing similarity distances between rankings
On the unimodality of Zhang-Zhang polynomials of parallelogram chains
An algebraic point of view of the data structures of database systems
Digraph width measures in parameterized algorithmics
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
Cycles and trees in randomly perturbed sparse digraphs
Alliance polynomial of regular graphs
Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms
Rectilinear path problems in restricted memory setup
Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints
On broadcasting time in the model of travelling agents
Walsh-Hadamard transforms of generalized p-ary functions and C-finite sequences
Signed analogue of general Kotzig-Lovász decomposition
Further results on an equitable 1-2-3 Conjecture
Note on the upper bound of the rainbow index of a graph
A sufficient condition for a planar graph to be 4-choosable
On rank and MDR cyclic and negacyclic codes of length pkover Zpm
Computing the blocks of a quasi-median graph
On spanning cycles, paths and trees
A (3, 1)*-choosable theorem on toroidal graphs
The diophantine problem of Frobenius: A close bound
New orthogonality criterion for shortest vector of lattices and its applications
Computation of best possible low degree expanders
Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension
Multi-objective matroid optimization with ordinal weights
When each hexagon of a hexagonal system covers it
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
The Wiener index in iterated line graphs
Equitable coloring of graphs beyond planarity
Linear-time fitting of a k-step function
A bound on the treewidth of planar even-hole-free graphs
The game chromatic index of some trees of maximum degree 4
Cocyclic Hadamard matrices and difference sets
Toughness and distance spectral radius in graphs involving minimum degree
Table of Large ( Delta, D )-Graphs
A method for enumerating pairwise compatibility graphs with a given number of vertices
Bounds for the solution set of linear complementarity problems
Signed graphs
Construction properties of combinatorial deltahedra
Graph lattices constructed by super total graceful-type labelings and colorings of topological coding
A survey of very large-scale neighborhood search techniques
Approximability of the dispersed p→-neighbor k-supplier problem
Small Cycles in Hamiltonian Graphs
Differential approximation schemes for half-product related functions and their scheduling applications
Fault-tolerant strong Menger connectivity with conditional faults on wheel networks
The h-extra connectivity and h-extra conditional diagnosability of Bubble-sort star graphs
Improved descriptional complexity results on generalized forbidding grammars
On dimer coverings of rectangles of fixed width
{1, 2}-good-neighbor conditional diagnosability of Cayley graphs generated by k-trees
Efficient Fault-Tolerant Fixed Routings on ( k + 1)-Connected Digraphs
Periodic schedules for linear precedence constraints
Bounds on the disparity and separation of tournament solutions
A clique algorithm for standard quadratic programming
The Forwarding Diameter of Graphs
Algorithm for partial sweep coverage on a line
Finding nonnormal bent functions
The Majority Strategy on Graphs
On Specifying Boolean Functions by Labelled Examples
Remainder approach for the computation of digital straight line subsegment characteristics
Checking oriented matroid isomorphism by means of canonical labeling
The self-affine property of (U, r)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS
Structure of decoders for multivalued encodings
Bounding the probability of the union of events by aggregation and disaggregation in linear programs
The 5-puzzle doubly covers the soccer ball
On the monotonicity of process number
Bifurcation structure of a discrete neuronal equation
Sorting with forbidden intermediates
SONET/SDH Ring Assignment with Capacity Constraints
Inapproximability results related to monophonic convexity
Antimagic orientation of subdivided caterpillars
The asymptotic behavior of some indices of iterated line graphs of regular graphs
Experiments in integer programming
Large Survivable Nets and the Generalized Prisms
Single machine scheduling with controllable release and processing parameters
A network approach for specially structured linear programs arising in 0-1 quadratic optimization
Efficient polynomial algorithms for distributive lattices
Resonance in Elemental Benzenoids
A two-commodity flow formulation for the capacitated truck-and-trailer routing problem
Approximation Techniques for Hypergraph Partitioning Problems
The signless Laplacian spectral radius of graphs with given degree sequences
Unitary Cayley graphs of finite semisimple rings
Word-representability of triangulations of grid-covered cylinder graphs
Some problems on induced subgraphs
The connected facility location polytope
The mathematical solution of a cellular automaton model which simulates traffic flow with a slow-to-start effect
On k-uniform random hypergraphs without generalized fans
A note on scheduling identical coupled tasks in logarithmic time
On the uniqueness of some girth eight algebraically defined graphs
Test sets for morphisms with bounded delay
An O( n ) Algorithm to Solve the Bottleneck Traveling Salesman Problem Restricted to Ordered Product Matrices
Unit form recognition by mutations: Application of mutations in the search of positive roots
Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size
Resistance distance and Kirchhoff index of R-vertex join and R-edge join of two graphs
Average Distance and Independence Number
An algorithm for constructing magic squares
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs
A generalized preimage for the digital analytical hyperplane recognition
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Packing a number of copies of a (p, q)-graph
Coloring squares of graphs with mad constraints
Chronological orderings of interval graphs
Edge dominating set and colorings on graphs with fixed clique-width
On Pseudounimodular Matrices
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
On the orthogonal designs of order 24
Approximation algorithms for demand-based job scheduling with reconfigurable resources
Further split graphs known to be Class 1 and a characterization of subgraph-overfull split graphs
Partitions and Network Reliability
Generating functions for inscribed polyominoes
On domination game stable graphs and domination game edge-critical graphs
New results on the 1-isolation number of graphs without short cycles
A Doubly Cyclic Channel Assignment Problem
Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
Cournot tâtonnement and dominance solvability in finite games
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
Component-cardinality-constrained critical node problem in graphs
Redfield's papers and their relevance to counting isomers and isomerizations
Dense and sparse graph partition
Continuous bottleneck tree partitioning problems
On Spanning 2-trees in a Graph
The shortest-path problem for graphs with random arc-lengths
Bivalent trees and forests or upper bounds for the probability of a union revisited
The Complexity of Multidimensional Periodic Scheduling
Sufficient conditions for k-factors and spanning trees of graphs
Path partition for graphs with special blocks
New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24)
New progress in combinatorial optimization
A complete analysis of the convergence of Cm(D)m=1∞ for a multipartite tournament D
minimum dominating set of queens: A trivial programming exercise?
Drawing c-planar biconnected clustered graphs
Subtree and Substar Intersection Numbers
Characterizations of maximum fractional (g, f)-factors of graphs
Characterizing upper bounds of Z-spectral radius of uniform hypergraphs
Connectivity of random hypergraphs with a given hyperedge size distribution
Optimal K-secure graphs
On the windy postman problem
On the extremal maximum agreement subtree problem
Efficient Algorithms for Some Path Partitioning Problems
Fixed points and maximal independent sets in AND-OR networks
Digital planarity - A review
Random small Hamming weight products with applications to cryptography
Vertex-magic labeling of regular graphs: Disjoint unions and assemblages
On decomposition of the Cartesian product of directed cycles into cycles of equal lengths
Reconstruction of Rooted Trees From Subtrees
A Vizing-type result for semi-total domination
Balanced Block Spacing for VLSI Layout
Network theory and transversal matroids
Pick-and-choose heuristics for partial set covering
A graph with the partial order competition dimension greater than five
Modeling the process of human body iron homeostasis using a variant of timed Petri nets
Neighbour sum distinguishing edge-weightings with local constraints
Recognition of probe distance-hereditary graphs
The complexity of the locally connected spanning tree problem
Recognizing the P 4 -structure of Block Graphs
Minimum values of the second largest Q-eigenvalue
Maker-Breaker domination game critical graphs
Least Q-eigenvalues of nonbipartite 2-connected graphs
Computerised decision aid for timetabling - a case analysis
Distance cube polynomials of Fibonacci and Lucas-run graphs
On the P3-hull number of some products of graphs
Symmetries and Sense of Direction in Labeled Graphs
Some recent results on niche graphs
Separation of Convex Sets
Computing Roots of Graphs Is Hard
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
Paroid Search: Generic Local Combinatorial Optimization
Parameterized complexity of fair deletion problems
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces
The diameter of strong orientations of Cartesian products of graphs
The strong metric dimension of the power graph of a finite group
Word-representability of Toeplitz graphs
Edge colouring line graphs of unicyclic graphs
On L(d, 1)-labeling of Cartesian product of a cycle and a path
Graphical representations of cyclic permutation groups
Restricted 123-avoiding Baxter permutations and the Padovan numbers
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Unique intersectability of diamond-free graphs
Proof of Stahl's conjecture in some new cases
Cubic vertices of minimal bicritical graphs
On Broadcasting Multiple Messages in a D-dimensional Grid
Hybrid one-dimensional reversible cellular automata are regular
Determination of the star valency of a graph
The vertices of the knapsack polytope
Subdivisions of four blocks cycles in digraphs with large chromatic number
On the NBC-complexes and beta-invariants of abstract convex geometries
Diameter-sufficient conditions for a graph to be super-restricted connected
On the structure of the adjacency matrix of the line digraph of a regular digraph
An upper bound for the minimum number of queens covering the n x n chessboard
On three polynomial kernels of sequences for arbitrarily partitionable graphs
Decomposition of circulant digraphs with two jumps into cycles of equal lengths
A factorization of the symmetric Pascal matrix involving the Fibonacci matrix
On the dominant of the Steiner 2-edge connected subgraph polytope
Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights
On maximum independent sets in P 5 -free graphs
Many-to-many disjoint paths in hypercubes with faulty vertices
Further results on random walk labelings
An Improved Upper Bound for the Subarray Partial Concentrators
Overlaid species forests
Studies on Hypergraphs I: Hyperforests
A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
O(mlogn) split decomposition of strongly-connected graphs
On the independence polynomial of the corona of graphs
Bounds on the Aα-spectral radius of uniform hypergraphs with some vertices deleted
Polynomial kernels for 3-leaf power graph modification problems
Scheduling jobs with equal processing times and a single server on parallel identical machines
Boundary defensive k-alliances in graphs
The packing number of the double vertex graph of the path graph
On spaced seeds for similarity search
A branch-and-cut algorithm for the latent-class logit assortment problem
Listing minimal edge-covers of intersecting families with applications to connectivity problems
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
Double Roman domination number
Characterization of common-edge sigraph
Erdös-Gallai-type problems for distance-edge-monitoring numbers
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer
A linear-time kernelization for the Rooted k-Leaf Outbranching Problem
On almost bipartite non-König-Egerváry graphs
Satisfiability of algebraic circuits over sets of natural numbers
Lower bounds for computing geometric spanners and approximate shortest paths
On the computational complexity of upper total domination
Weighted antimagic labeling
A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs
On the spanning fan-connectivity of graphs
A unified approach for price directive decomposition procedures in integer programming
Some polynomially solvable subcases of the detailed routing problem in VLSI design
The set chromatic number of random graphs
Weavings, sections and projections of spherical polyhedra
Improved approximations for max set splitting and max NAE SAT
Immune sets in monotone infection rules. Characterization and complexity
Broadcasting multiple messages in a grid
Feedback game on 3-chromatic Eulerian triangulations of surfaces
Analysis of a generalized Friedman's urn with multiple drawings
Antimagic labeling of forests with sets of consecutive integers
Erratum to "Reduction of symmetric configurations n 3 " [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]
Book drawings of complete bipartite graphs
Polyhedral properties of the induced cluster subgraphs
Unicyclic graphs with extremal values of arithmetic-geometric index
Graph representations of a bicircular matroid
Impact of memory size on graph exploration capability
On disconnected cuts and separators
Utility Representation via Additive or Multiplicative Error Functions
On r-hued list coloring of K4(7)-minor free graphs
Morphisms for resistive electrical networks
Characterizing interval graphs which are probe unit interval graphs
On highly palindromic words: The n-ary case
Computing longest common extensions in partial words
Source Sink Flows with Capacity Installation in Batches
Circular mixed hypergraphs II: The upper chromatic number
Monopolar graphs: Complexity of computing classical graph parameters
Two-tuple balance of non-binary sequences with ideal two-level autocorrelation
On the distance distribution of trees
The Cyclic Cutwidth of Trees
Rainbow connection and minimum degree
A note on Alon-Tarsi number of Halin graphs
On the minimum Harary index of graphs with a given diameter or independence number
Generalized hexagonal systems with each hexagon being resonant
Interval degree and bandwidth of a graph
Maximizing the number of requests in oriented trees with a grooming factor
Subset-conjunctive rules for breast cancer diagnosis
On the anti-Kekulé number of (4, 5, 6)-fullerenes
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
Various matching keys for asymmetric topology encryption
l-facial edge colorings of graphs
A solvable class of quadratic 0-1 programming
On island sequences of labelings with a condition at distance two
Linear splicing and syntactic monoid
An outer-approximation algorithm for maximum-entropy sampling
Solution techniques for the Large Set Covering Problem
On perfect hashing of numbers with sparse digit representation via multiplication by a constant
Characterizations of Max-Balanced Flows
Efficient algorithms for decomposing graphs under degree constraints
Kings and Heirs: A characterization of the (2, 2)-domination graphs of tournaments
Domination, coloring and stability in P5-reducible graphs
A polyhedral study of the maximum-impact coloring problem on hypergraphs
The level matrix of a tree and its spectrum
Bisecting and D-secting families for set systems
A note on Seymour's second neighborhood conjecture
Restricted k-ary words and functional equations
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
Homomorphisms and Ramsey properties of antimatroids
Bounds on the Number of Knight's Tours
Self-dual codes and Hadamard matrices
b-colouring the Cartesian product of trees and some other graphs
Complexity of Tree Homomorphisms
Recognizing line-polar bipartite graphs in time O(n)
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2
(2, 2)-colourings and clique-free σ-hypergraphs
Properties and constraints of cheating-immune secret sharing schemes
Barycentric systems and stretchability
Constructions of k-critical P5-free graphs
The circular chromatic number of signed series-parallel graphs of given girth
On families of quadratic surfaces having fixed intersections with two hyperplanes
On (2,k)-Hamilton-connected graphs
Hamiltonicity of large generalized de Bruijn cycles
Sequences generated by infinitely iterated morphisms
Further results on hierarchical product of graphs
Counting unique-sink orientations
The forcing hull and forcing geodetic numbers of graphs
Computing the Laplacian spectra of some graphs
Some new two-weight codes and strongly regular graphs
A constrained sports scheduling problem
Lengths of tours and permutations on a vertex set of a convex polygon
Maximum Cut on Line and Total Graphs
Most specific consequences in the description logic EL
On the approximation of the Minimum Disturbance p-Facility Location Problem
A Note on Subtrees Rooted Along the Primary Path of a Binary Tree
Optimizing movement in convex and non-convex path-networks to establish connectivity
On a class of functions attaining their maximum at the vertices of a polyhedron
On some identities for the Fibonomial coefficients via generating function
Meta-kernelization using well-structured modulators
Maximal partial clones determined by the areflexive relations
Two-dimensional closest pair problem: A closer look
A tight analysis of the Submodular-Supermodular Procedure
Minimal spread of integral circulant graphs
Sensitivity Analysis in Isotonic Regression
Algorithms for the fixed linear crossing number problem
Reputation games for undirected graphs
Note on Combinatorial Optimization with Max-Linear Objective Functions
Pairs of graphs with site and bond percolation critical probabilities in opposite orders