yusuke1997/dblp-id-title huggingface dataset:
Distances in a rigid unit-distance graph in the plane
Preassignment Requirements in Chromatic Scheduling
The Hamming distances of repeated-root cyclic codes of length 5ps
Structurally parameterized d-scattered set
A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L 1
Bisecting a 4-connected graph with three resource sets
Channel assignment problem and relaxed 2-distant coloring of graphs
Segmental solutions of Boolean equations
Further results on the largest matching root of unicyclic graphs
Pattern-avoiding alternating words
On the hole index of L(2, 1)-labelings of r-regular graphs
On the uniqueness of some girth eight algebraically defined graphs, Part II
Improving graph partitions using submodular functions
Matching and spanning trails in digraphs
Finding submasses in weighted strings with Fast Fourier Transform
A note on transitive orientations with maximum sets of sources and sinks
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
Extremal numbers for disjoint copies of a clique
On the minimum size of 4-uniform hypergraphs without property B
Optimal communication channel utilization for matrix transposition and related permutations on binary cubes
Forbidden triples generating a finite set of graphs with minimum degree three
Homomorphisms of conjunctive normal forms
A characterization of graphs with two types of eigenvalue multiplicities equal to n-d-1
The combinatorial approach yields an NC algorithm for computing Pfaffians
Minimal graphs for matching extensions
Dot product dimensions of graphs
A New Algorithm for Jordan Sorting: Its Average-Case Analysis
Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
On coloring the arcs of biregular graphs
On the Randić index and girth of graphs
A Result of Vapnik with Applications
On counting interval lengths of interval graphs
On full-separating sets and related codes in graphs
Location of weighted anti-ordered median straight lines with Euclidean distances
Each maximal planar graph with exactly two separating triangles is Hamiltonian
Cardinality-restricted Chains and Antichains in Partially ordered Sets
Edge-oblique polyhedral graphs
The fractional weak discrepancy of a partially ordered set
Parallel Machine Scheduling with Time Dependent Processing Times
On the reliability of generalized Petersen graphs
On Testing Consecutive-ones Property in Parallel
Shortcutting directed and undirected networks with a degree constraint
On the Merrifield-Simmons index of tricyclic graphs
Edge-rooted forests and the alpha-invariant of cone graphs
Query learning algorithm for ordered multi-terminal binary decision diagrams
On doing Todd-Coxeter coset enumeration in parallel
On some Properties of DNA Graphs
Local medians in chordal graphs
Broadcasting in Random Graphs
Representation of graphs by OBDDs
The digrundy number of digraphs
Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
Maximum bisections of graphs without cycles of length four and five
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Structural rigidity II: Almost infinitesimally rigid bar frameworks
Combinatorial optimization with one quadratic term: Spanning trees and forests
Open neighborhood locating-dominating in trees
Graphic sequences, distances and k-degree anonymity
Geography, games and graphs
Positive semidefinite propagation time
A very elementary presentation of the Hannenhalli-Pevzner theory
Graph curvature via resistance distance
Chromatic-choosability of the power of graphs
Degenerate matchings and edge colorings
A class of graphs that complementation makes infinitely many Cohen-Macaulay members
The complexity of detecting fixed-density clusters
Approximating weighted induced matchings
Cycles embedding in folded hypercubes with conditionally faulty vertices
Van Lier sequences
A faster FPTAS for counting two-rowed contingency tables
Lower bounds for the Laplacian energy of bipartite graphs
The firefighter problem with more than one firefighter on trees
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1
On Connected Boolean Functions
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number
Linear binary codes with intersection properties
Long Cycles and Long Paths in the Kronecker Product of a Cycle, a Tree
An algorithm to recognize a middle graph
Upper bounds on the locating chromatic number of trees
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs
A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid
How to Cut a Cake Fairly Using a Minimal Number of Cuts
Valid inequalities for mixed 0-1 programs
Non-standard approaches to integer programming
A survey on Knödel graphs
On K Δ
Approximation Algorithms for Min-sum p-clustering
Cycles embedding in folded hypercubes under the conditional fault model
A computational study on Integer Programming formulations for Hop-constrained survivable network design
Completely independent spanning trees in some regular graphs
Broadcasts in graphs
The complexity of broadcasting in planar and decomposable graphs
Discrete Dirichlet integral formula
Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence
Highly connected random geometric graphs
Counting Symmetric Configurations v 3
New variants of perfect non-crossing matchings
A note on compact graphs
Pooling designs with surprisingly high degree of error correction in a finite vector space
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
New extremal binary self-dual codes from a Baumert-Hall array
On the complexity of deriving position specific score matrices from positive and negative sequences
A Branch and Bound Algorithm for the Job-Shop Scheduling Problem
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
Gaussian discrepancy: A probabilistic relaxation of vector balancing
Overlaps help: Improved bounds for group testing with interval queries
The Number of Keys in Relational and Nested Relational Databases
Bisecting binomial coefficients
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
Height of minor faces in plane normal maps
On locally identifying coloring of Cartesian product and tensor product of graphs
Colouring graphs of bounded diameter in the absence of small cycles
On the joint distribution of the insertion path length and the number of comparisons in search trees
Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74
Minus domination in small-degree graphs
On the kernelization of ranking r-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments
On (exponential) bond incident degree indices of graphs
Polyhedra associated with identifying codes in graphs
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption
On odd colorings of sparse graphs
Packing equal circles in a square: a deterministic global optimization approach
Zero forcing of generalized hierarchical products
The chromatic discrepancy of graphs
A note on the domination dot-critical graphs
Matchability and k-maximal matchings
Multi-symbol forbidden configurations
A note on generalized semitotal point graphs
Definability of Boolean function classes by linear equations over GF(2)
Cube-connected circulants: Bisection width, Wiener and forwarding indices
Worst-case study of local search for MAX-k-SAT
Algorithms and codes for dense assignment problems: the state of the art
On polygon numbers of circle graphs and distance hereditary graphs
A min-max theorem for plane bipartite graphs
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming
Analysis of Scheduling Problems with Typed Task Systems
Indexing functions and time lower bounds for sorting on a mesh-connected computer
On chromatic and flow polynomial unique graphs
New bounds of degree-based topological indices for some classes of c-cyclic graphs
On orthogonal ray graphs
On graphs maximizing the zero forcing number
Fault-tolerant dispersion of mobile robots
Adding isolated vertices makes some greedy online algorithms optimal
Decision Problems and Regular Chain Code Picture Languages
Balanced k-decompositions of graphs
Infinite classes of generalised complete permutations
On the combinatorial structure of chromatic scheduling polytopes
On Spieß's conjecture on harmonic numbers
The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
A lower bound on the constant in the Fourier min-entropy/influence conjecture
Parameterized complexity for iterated type partitions and modular-width
Tree coloring with predictions
Minimum sum set coloring of trees and line graphs of trees
on Powers of M-trapezoid Graphs
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Mixed metric dimension of graphs with edge disjoint cycles
Graph Partitioning Applied to the Logic Testing of Combinational Circuits
Variants of (d, t)-Wythoff's game
Domination analysis of some heuristics for the traveling salesman problem
On the conjecture of the r-uniform supertrees with the eight largest α-spectral radii
On subword complexity functions
Finding the closest ultrametric
obstruction Set Isolation for the Gate Matrix Layout Problem
On tame, pet, domestic, and miserable impartial games
The maximum deviation just-in-time scheduling problem
Further results on the Merrifield-Simmons index
Labelling planar graphs without 4-cycles with a condition on distance two
A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
On maximum induced forests of the balanced bipartite graphs
A Family of Cayley Graphs on the Hexavalent Grid
Organizing the atoms of the clique separator decomposition into an atom tree
Paired-domination in binary trees
Mathematical crystal growth I
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks
Unimodality and log-concavity of f f-vectors for cyclic and ordinary polytopes
Z-cyclic Whist Tournaments with a Patterned Starter Initial Round
On the acyclic disconnection of multipartite tournaments
A Riemann hypothesis analogue for near-MDS codes
On the size of graphs without repeated cycle lengths
Periodic Assignment and Graph Colouring
On (n, k)-sequences
New results on the enumeration of non-intersecting random walks
Decidability problems for unary output sequential transducers
SVD, discrepancy, and regular structure of contingency tables
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
A Lower Bound on the Weight Hierarchies of Product Codes
A difficulty in particular Shannon-like games
Coloring Edges of Self-complementary Graphs
On k-shifted antimagic spider forests
Anti-Ramsey number of matchings in outerplanar graphs
Game brush number
Minimum degree distance among cacti with perfect matchings
List star edge-coloring of k-degenerate graphs and K4-minor free graphs
Some further results on the maximal hitting times of trees with some given parameters
Generalized hyper-bent functions over GF(p)
Hamiltonian path saturated graphs with small size
Reinforcement numbers of digraphs
Recognizing Hidden Bicircular Networks
Proximity, remoteness and distance eigenvalues of a graph
Preface: Workshop on Advances in Optimization
On Strongly Connected Digraphs with Bounded Cycle Length
Correction to "On the distance Laplacian spectral radius of bipartite graphs" [Discrete Appl. Math. 186 (2015) 207-213]
On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane
On the PBD-closure of Sets Containing 3
Topological properties on the diameters of the integer simplex
Strategies of loop recombination in ciliates
Computing the forcing spectrum of outerplanar graphs in polynomial time
Why Should Biconnected Components be Identified First
A proof of the conjecture regarding the sum of domination number and average eccentricity
q-functional equations and some partition identities
The path-factors and generalized distance spectral radius of graphs
Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs
A complete characterization of jump inequalities for the hop-constrained shortest path problem
Statistics on trapezoidal words and k-inversion sequences
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs
Construction of regular homogeneously traceable nonhamiltonian graphs
An extended hypergraph cut method for the Wiener index
Polynomial-time recognition of clique-width ≤3 graphs
Score certificate numbers of upset tournaments
A note on eigenvalue, spectral radius and energy of extended adjacency matrix
On a relation between the domination number and a strongly connected bidirection of an undirected graph
Total choosability of planar graphs with maximum degree 4
Values for cooperative games with a prior unions and a communication graph based on combined effects
All-pairs-shortest-length on Strongly Chordal Graphs
Scheduling independent two processor tasks on a uniform duo-processor system
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
On the number of optimal identifying codes in a twin-free graph
On (t, r) broadcast domination numbers of grids
Point placement on the line by distance data
The spanning cyclability of Cayley graphs generated by transposition trees
Constructing Status Injective Graphs
Some extremal problems on Aα-spectral radius of graphs with given size
Open shop scheduling problems with late work criteria
Quasi-hamiltonian paths in semicomplete multipartite digraphs
Secure domination in cographs
A New Proof of Wojcicka's Conjecture
NP-completeness results for edge modification problems
Pattern Minimisation in Cutting Stock Problems
A sufficient condition for a plane graph with maximum degree 6 to be class 1
On CD-chromatic number and its lower bound in some classes of graphs
Biography of Martin Farber, 1951-1989
Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion
Lexicographical polytopes
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines
An exact algorithm for the channel assignment problem
Unconstrained 0-1 optimization and Lagrangean relaxation
Upper bounds on the Boolean rank of Kronecker products
Bipartition constrained edge-splitting in directed graphs
Super-simple Steiner pentagon systems
Improper C-colorings of graphs
The Bin Packing Problem with Item Fragmentation: A worst-case analysis
Contraction obstructions for connected graph searching
Minimal average cost of searching for a counterfeit coin: Restricted model
The m-step competition graph of a digraph
Laplacian and Wiener index of extension of zero divisor graph
Permutation bigraphs and interval containments
Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support
A New Look at the de Bruijn Graph
On the chromatic number of graphs of odd girth without longer odd holes
Enumerating (2+2)-free posets by the number of minimal elements and other statistics
The k-cardinality Assignment Problem
The fractional strong metric dimension in three graph products
The Single Loop Representations of Regular Languages
Annealed replication: a new heuristic for the maximum clique problem
Metric and ultrametric spaces of resistances
Edge coloring of graphs of signed class 1 and 2
Three value TSP and linkages with the three value linear spanning 2-forests
Time-optimal Tree Computations on Sparse Meshes
A digital analogue of the Jordan curve theorem
A Unifying Location Model on Tree Graphs Based on Submodularity Properties
Cops and Robber on butterflies, grids, and AT-free graphs
Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph
On intersecting families of independent sets in trees
PTAS for H-free node deletion problems in disk graphs
The minimum size of graphs satisfying cut conditions
Strict chordal digraphs viewed as graphs with distinguished edges
Graphs whose Wiener index does not change when a specific vertex is removed
Errata to "Selecting the Top Three Elements" by M. Aigner: A Result of a Computer-Assisted Proof Search
Bundling all shortest paths
Extension operators for TU games and the Lovász extension
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
Eulerian disjoint paths problem in grid graphs is NP-complete
Infinite family of 3-connected cubic transmission irregular graphs
On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures
An upper bound on path cover number of regular graphs and its application to Hamiltonian cycle in tough graphs
Searching for a counterfeit coin with two unreliable weighings
Routeing Winter Gritting Vehicles
The New Periodicity Lemma revisited
On the sum of k largest distance eigenvalues of graphs
Effects of vertex degrees on the zero-forcing number and propagation time of a graph
Tighter bound for MULTIFIT scheduling on uniform processors
On the (co)girth of a connected matroid
The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking)
Mutual-visibility in strong products of graphs via total mutual-visibility
On the ordering of graphs with respect to their matching numbers
Bijective counting of humps and peaks in (k, a)-paths
A classification of edge-colored graphs based on properly colored walks
On graphs with excess or defect 2
Subprime and superprime graphs
Leveraging duality for the gamma-robust segment routing traffic engineering problem
Characterization of optimal key set protocols
On the index of maximum density for irreducible Boolean matrices
Lower bounds for the clique and the chromatic numbers of a graph
Four new sums of graphs and their Wiener indices
The Ramsey number for a cycle of length six versus a clique of order eight
The basic algorithm for pseudo-Boolean programming revisited
An Infinite Class of Z-cyclic Whist Tournaments on v Players, v 1 (mod 4)
New characterizations and a concept of potential for each multinomial (probabilistic) value
Path 3-(edge-)connectivity of lexicographic product graphs
A Tight Bound for 3-Partitioning
On monotone functions of tree structures
Characterizing the fullerene graphs with the minimum forcing number 3
Use of the Szeged index and the revised Szeged index for measuring network bipartivity
Finding Regular Subgraphs in Both Arbitrary and Planar Graphs
Offensive r-alliances in graphs
Distance-hereditary comparability graphs
Facet-generating procedures for the maximum-impact coloring polytope
Irregular independence and irregular domination
An augmenting graph approach to the stable set problem in P 5 -free graphs
The game chromatic index of wheels
Lower bounds for monotone counting circuits
Bounds on the independence number of a graph in terms of order, size and maximum degree
A refinement of the common cause principle
Rainbow domination numbers on graphs with given radius
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
Domination analysis of combinatorial optimization problems
On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B 1 - and B 2 -branches
Shortest odd paths in undirected graphs with conservative weight functions
Routing a Vehicle of Capacity Greater than one
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time
Agent incentives of strategic behavior in resource exchange
Treewidth and gonality of glued grid graphs
Multitasking via alternate and shared processing: Algorithms and complexity
Recursions for quadratic rotation symmetric functions weights
A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
Zagreb eccentricity indices of unicyclic graphs
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
On the asymptotic order of circuit codes
Series-parallel chromatic hypergraphs
On complexity of minimization and compression problems for models of sequential choice
Exact value of ex(n;{c 3 , ..., c s }) for n ≤ [25(s-1)/8]
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
On the L (2, 1)-labelings of amalgamations of graphs
Further combinatorial identities deriving from the n th power of a 2×2 matrix
Dynamic Behavior of Cyclic Automata Networks
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events
Coding, Cryptography, and Computer Security - Preface
Complementary Riordan arrays
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective
On compatibility and incompatibility of collections of unrooted phylogenetic trees
Some local-global phenomena in locally finite graphs
Finding the longest isometric cycle in a graph
The distance matrix of caterpillar
The vertex Turán density in 3-ary n-cubes
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
The complexity of finding two disjoint paths with min-max objective function
Generating and counting unlabeled k-path graphs
Pebble exchange on graphs
Tricyclic graphs with maximal revised Szeged index
Strong edge colouring of subcubic graphs
Characterization of signed line digraphs
The matching polynomial of the path-tree of a complete graph
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
Duality for balanced submodular flows
Job shop scheduling with unit time operations under resource constraints and release dates
Unextendible product bases and 1-factorization of complete graphs
On the Shortest Path Game
Sparse hypergraphs with applications in combinatorial rigidity
Characterizations, probe and sandwich problems on (k, ℓ)-cographs
A modular approach to Sprouts
On colouring point visibility graphs
On extendability of co-edge-regular graphs
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
Edge ranking of weighted trees
Regular sets in circulant graphs with degree 3
Super-simple (v, 4, 2) directed designs and a lower bound for the minimum size of their defining set
Nonograms: Combinatorial questions and algorithms
Edge consecutive gracefulness of a graph
Optimal stopping in a search for a vertex with full degree in a random graph
The spectral radius of the hypergraphs without the expansion of P 3 or Berge- P k
An addition algorithm in Jacobian of C ab curves
Proofs of conjectures on the Randić index and average eccentricity
Structure and coloring of (P7, C5, diamond)-free graphs
On the probabilistic minimum coloring and minimum k -coloring
Estimating satisfiability
Fractional zero forcing via three-color forcing games
The maximal energy of classes of integral circulant graphs
Disjoint Hamilton cycles in transposition graphs
P 5 -free augmenting graphs and the maximum stable set problem
Complexity aspects of the triangle path convexity
Restricted t-matchings in bipartite graphs
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs
Matching preclusion for vertex-transitive networks
Disjunctive and conjunctive normal forms of pseudo-Boolean functions
Morphological filtering on hypergraphs
"Integer-making" theorems
Optimal approximability of bookmark assignments
Optimal schedules for periodically recurring events
Informative path planning as a maximum traveling salesman problem with submodular rewards
Bondage number of the strong product of two trees
Eigenvectors of interval matrices over max-plus algebra
Encryption using Hungarian rings
A note on odd colorings of 1-planar graphs
The changes in distance Laplacian spectral radius of graphs resulting from graft transformations