yusuke1997/dblp-id-title huggingface dataset:
A survey on maximum distance holey packings
Most Uniform Path Partitioning and its Use in Image Processing
The Discrete Moment Method for the numerical integration of piecewise higher order convex functions
The stack loading and unloading problem
The weighted vertex PI index of bicyclic graphs
New bounds for the b-chromatic number of vertex deleted graphs
Scheduling sports tournaments with two court types
Union-intersection-bounded families and their applications
Proximity and remoteness in graphs: A survey
Bicritical graphs without removable edges
On erasing in EOL forms
On an optimization problem with nested constraints
Collision-free path coloring with application to minimum-delay gathering in sensor networks
On a game of policemen and robber
Neighbour-connectivity in regular graphs
3-dynamic coloring and list 3-dynamic coloring of K 1, 3 -free graphs
Spectral characterization of the complete graph removing a path
Vertex characterization of partition polytopes of bipartitions and of planar point sets
A More Efficient Algorithm for MPR Problems in Phylogeny
Stability number of bull- and chair-free graphs revisited
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
On the X-join decomposition for undirected graphs
On the bandwidth of the Kneser graph
Colorings and interpretations: a connection between graphs and grammar forms
Spanning trails in essentially 4-edge-connected graphs
Maximally connected p-partite uniform hypergraphs
on Paving Matroids and a Generalization of MDS Codes
Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem
Largest polygons with vertices in a given finite set
On the Complexity and Approximation of Syntenic Distance
Changing and Unchanging the Diameter of a Hypercube
Super-connected edge transitive graphs
Paths to Marriage Stability
Multiple levels of preference in interactive strategic decisions
The fault tolerance of (n, k)-bubble-sort networks
Gridline graphs: a review in two dimensions and an extension to higher dimensions
Classification of P k2
On packing S-colorings of subcubic graphs
Some remarks on inverse Wiener index problem
On a problem of Erdős, Herzog and Schönheim
General graph pebbling
Computing Maximum Mean Cuts
Generating binary partial Hadamard matrices
On the strong Roman domination number of graphs
On the unit interval number of a graph
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
On the minimum and maximum selective graph coloring problems in some graph classes
On the distance Laplacian spectral radius of bipartite graphs
The butterfly decomposition of plane trees
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
How many double squares can a string contain?
On a conjecture of Schweser and Stiebitz
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
Trapezoidal Matrices and the Bottleneck Assignment Problem
Arrow's Theorem for Closed Weak Hierarchies
A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
Decomposition of bipartite graphs into special subgraphs
Compatibility of partitions with trees, hierarchies, and split systems
Adaptive memory search for Boolean optimization problems
On directed covering and domination problems
Biclique graphs of split graphs
Approximately counting paths and cycles in a graph
Performances of Parallel Branch and Bound Algorithms with Best-first Search
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
Projective planes and congestion-free networks
A generalization of the firefighter problem on Z×Z
Broadcasting on recursively decomposable Cayley graphs
The Gateway Location Problem: Assessing the impact of candidate site selection policies
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Integer orbits in rectangular lattice billiards
On bisectors for different distance functions
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
The cost of cutting out convex n -gons
Orientable convexity, geodetic and hull numbers in graphs
The interval structure of (0, 1)-matrices
Efficient parameterized algorithms for computing all-pairs shortest paths
An inequality on global alliances for trees
4-coverable snarks, perfect matching cover, and Isaacs product
Wiener and vertex PI indices of Kronecker products of graphs
The contour of a bridged graph is geodetic
Finding a bigtriangleup-regular supergraph of minimum order
On an extremal problem concerning the interval number of a graph
Throttling positive semidefinite zero forcing propagation time on graphs
On Ramsey numbers of complete graphs with dropped stars
On the treewidth of token and Johnson graphs
General sharp upper bounds on the transversal coalition number
Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday
On z-coloring and b∗-coloring of graphs as improved variants of the b-coloring
On intermediate factorial languages
Vertex-arboricity of toroidal graphs without K5- and 6-cycles
Finding a central vertex in an HHD-free graph
An algorithm for collapsing sign alternating sequences of real numbers
Routing Multiterminal Nets on a Hexagonal Grid
Problems related to a de Bruijn-Erdös theorem
A similarity transform for linear finite state machines
Note on Complexity of Computing the Domination of Binary Systems
Random Knapsacks with Many Constraints
Efficient algorithms for path partitions
Integer programming by long division
Searching for a counterfeit coin with b-balance
On optimal approximability results for computing the strong metric dimension
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
Graphs with maximal σ irregularity
Search problems on graphs
The eccentricity matrix of a digraph
An efficient algorithm for testing goal-minimality of graphs
Cooperative twin-crane scheduling
On encodings of spanning trees
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching
Game total domination critical graphs
Simple Splicing Systems
Implicit representation conjecture for semi-algebraic graphs
Augmenting graphs for independent sets
Automatic complexity of Fibonacci and Tribonacci words
A simple minimum T-cut algorithm
A graph theoretical approach to equivalence of multistage interconnection networks
A new Van der Waerden number
The edge-diametric theorem in Hamming spaces
Second-order productivity, second-order payoffs, and the Shapley value
( a , b )-codes in Z / n Z
An edge grafting theorem on the Estrada index of graphs and its applications
An external memory data structure for shortest path queries
Nine classes of permutations enumerated by binomial transform of Fine's sequence
Disjunctive Programming: Properties of the Convex Hull of Feasible Points
Variations on the Erdős distinct-sums problem
Update on Sidon-Ramsey numbers
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction
Facets of the axial three-index assignment polytope
Reasoning with ordered binary decision diagrams
On the extremal values of the eccentric distance sum of trees
Dynamic list coloring of bipartite graphs
On arithmetic sums of Cantor-type sequences of integers
A Lagrangian heuristic algorithm for a real-world train timetabling problem
Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella
Monotonicity of the minimum cardinality of an identifying code in the hypercube
Lower bounds for the complexity of restrictions of Boolean functions
On claw-free asteroidal triple-free graphs
Feedback vertex set on AT-free graphs
On the dominating induced matching problem: Spectral results and sharp bounds
On Pseudomodular Matroids and Adjoints
Classification and generation of nanocones
Storing four elements in the two query bitprobe model
Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs
Discrepancy minimizing spectral clustering
On r-dynamic coloring of grids
N-free posets as generalizations of series-parallel posets
An algorithm for single machine sequencing with release dates to minimize total weighted completion time
On a unique tree representation for P 4 -extendible graphs
Bernoulli Numbers and the Probability of a Birthday Surprise
On the Broadcast problem for mobile agents in dynamic networks
Energy of a graph and Randić index of subgraphs
The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
Gated independence in graphs
Bounds on the connected k-domination number in graphs
The ordered anti-median problem with distances derived from a strictly convex norm
An improved approximation for Maximumk-dependent Set on bipartite graphs
Mixed fault diameter of Cartesian graph bundles
Constructive characterizations of the value-function of a mixed-integer program I
Dirichlet problem on locally finite graphs
On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
The exchange-stable marriage problem
Complexity of finding a join of maximum weight
Scheduling co-operating stacking cranes with predetermined container sequences
Efficient Generation of Graphical Partitions
Spectral Partitioning with Multiple Eigenvectors
An O(n 1.5 ) algorithm to color proper circular arcs
Drawing Graphs on Rectangular Grids
S-packing colorings of distance graphs G(Z, {2, t})
The stable marriage problem with master preference lists
Finding induced trees
On structural parameterizations for the 2-club problem
Comparing the power of cops to zombies in pursuit-evasion games
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
Optimal welfare strategies vs Nash Equilibrium strategies in a game with homogeneous players
Special Issue on Coding and Cryptography
On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
on Graphs with Equal Domination and Covering Numbers
A counterexample to the pseudo 2-factor isomorphic graph conjecture
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Independence in connected graphs
A note on the upper bound and girth pair of ( k ; g )-cages
On Minimal Imperfect Graphs Without Induced P 5
An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
Well Irredundant Graphs
Efficient domination for classes of P 6 -free graphs
The Exact Bound of Lee's MLPT
Some results on Vizing's conjecture and related problems
Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau
Whole-genome prokaryotic clustering based on gene lengths
Preface: CALDAM 2018
Generalized Exponents of Primitive Symmetric Digraphs
Perfect matching and distance spectral radius in graphs and bipartite graphs
On the vertex stability numbers of graphs
Complete split graph determined by its (signless) Laplacian spectrum
On the complexity of the shortest-path broadcast problem
A general model for cyclic machine scheduling problems
The graphs cospectral with the pineapple graph
Orientable and negative orientable sequences
Effects of edge addition or removal on the nullity of a graph
On some Infinite Series of (r, 1)-Designs
On Complexity, Representation and Approximation of Integral Multicommodity Flows
Conserved Synteny As a Measure of Genomic Distance
The best choice problem for a union of two linear orders with common maximum
Discrete location problems with push-pull objectives
Characterizations of Consistent Marked Graphs
Protein folding in the HP model on grid lattices with diagonals
Recognizing generalized Petersen graphs in linear time
Transient length in sequential iteration of threshold functions
Note on injective edge-coloring of graphs
Characterizations of cographs as intersection graphs of paths on a grid
A note on the localization number of random graphs: Diameter two case
On Sturmian graphs
The existence of a {K1,2,K1,3,K5}-factor based on the size or the Aα-spectral radius of graphs
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
Total colorings of planar graphs without chordal 6-cycles
Euler is standing in line dial-a-ride problems with precedence-constraints
Concerning a conjecture on matching Kneser graphs
Linear codes for high payload steganography
Nested chain partitions of LYM posets
Degree distance and vertex-connectivity
On the Aα-spectral radius of graphs with given size
A method for efficiently computing the number of codewords of fixed weights in linear codes
The Median Function on Distributive Semilattices
k-Ary spanning trees contained in tournaments
The k-regular induced subgraph problem
The complexity of flood-filling games on graphs
Binary clustering
Openshop Scheduling with Machine Dependent Processing Times
Optimal mass production
On the L 2 -discrepancy
Clique tree generalization and new subclasses of chordal graphs
Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
On the minimal energy ordering of trees with perfect matchings
On the uniform edge-partition of a tree
Reconfiguration of list edge-colorings in a graph
Graph Theoretical Invariants and Elementary Subgraphs of Polyhex and Polypent/polyhex Systems of Chemical Relevance
Strong qualitative independence
Resolving the hypercube
Moments in graphs
Hardness results of global roman domination in graphs
The Chromatic Difference Sequence of the Cartesian Product of Graphs: Part II
Algorithms for high dimensional stabbing problems
k-foldability of words
Distance-hereditary graphs are clique-perfect
A strong connectivity property of the generalized exchanged hypercube
The expressive power of binary submodular functions
The edge metric dimensions of convex polytopes
Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families
Approximation algorithms for some optimum communication spanning tree problems
Strong resolving graphs: The realization and the characterization problems
Injectivity and weak ternary separation
Connected positive influence dominating set in k-regular graph
The combinatorics of Motzkin polyominoes
Interval edge-colorings of K 1, m, n
On the packing chromatic number of Moore graphs
The robot crawler graph process
Lines on digraphs of low diameter
The Covering Radius of the Cycle Code of a Graph
The complexity of surjective homomorphism problems - a survey
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing
On Certain Hamiltonian Inner Triangulations
Characterization of component diagnosability of regular networks
One pile misère bounded Nim with two alliances
Perfect matchings of (4,6)-fullerenes with largest forcing number
On the distance spread of cacti and bicyclic graphs
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Non-Singular graphs with a Singular Deck
Domination in intersecting hypergraphs
Neighbor sum distinguishing edge colorings of sparse graphs
Graph multi-coloring for a job scheduling application
Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs
The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
Scheduling problem with multi-purpose parallel machines
Exchange relations, Dyck paths and copolymer adsorption
Capacitated discrete unit disk cover
Regular coronoids and 4-tilings
A laminarity property of the polyhedron described by a weakly posi-modular set function
Simplifying optimal strategies in limsup and liminf stochastic games
Upper bounds on the Steiner diameter of a graph
Mixing time of the switch Markov chain and stable degree sequences
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
Bondage number of grid graphs
Network decontamination under m-immunity
Dot product dimension of unicyclic graphs
Distance labeling schemes for well-separated graph classes
Scheduling jobs with fixed start and end times
A polyhedral view to a generalization of multiple domination
On Some Optimization Problems on k -Trees and Partial k -Trees
Acyclic 4-edge colouring of non-regular subcubic graphs in linear time
A class of three-weight and five-weight linear codes
Pruning the Search Tree in the Constructive Enumeration of Molecular Graphs
On the size of immune sets in the k-PULL infection model
Facial L(2, 1)-edge-labelings of trees
The Shields-Harary Number for Wheel and Broken Wheel Graphs
Moving through Cartesian products, coronas and joins in general position
On the power of synchronization in parallel computations
Oriented matroid systems
Optimal pebbling and rubbling of graphs with given diameter
The weighted total cophenetic index: A novel balance index for phylogenetic networks
Optimal key for taxons ordered in accordance with their frequencies
A class of asymptotically optimal group testing strategies to identify good items
A note on an induced subgraph characterization of domination perfect graphs
Edge fault tolerance of graphs with respect to super edge connectivity
Minimum Vertex Weighted Deficiency of ( g, f )-Factors: A Greedy Algorithm
On the bounds for signless Laplacian energy of a graph
A spectral condition for a graph to have strong parity factors
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
Planar kernel and grundy with d≤3, d out ≤2, d in ≤2 are NP-complete
Minimizing a sum of submodular functions
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints
Equivalence between pathbreadth and strong pathbreadth
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection
Fast algorithms for identifying maximal common connected sets of interval graphs
Reconstruction of domino tilings - Combinatorial and probabilistic questions
Coherent network partitions
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions
A characterization of graphs with maximum cycle isolation number
The distance spectral radius of digraphs
Several classes of PcN power functions over finite fields
Algorithms for unipolar and generalized split graphs
Extension problems with degree bounds
Italian domination in trees
Intersection Graphs of Concatenable Subtrees of Graphs
The hexagonal chains with the first three maximal Mostar indices
Resistance distances in generalized join graphs
Roman {3}-domination in graphs: Complexity and algorithms
Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective
Polygon Scheduling
Frequency-based views to pattern collections
Lattice bandwidth of random graphs
Constructing completely independent spanning trees in crossed cubes
Algorithms and complexity for least median of squares regression
Most and least uniform spanning trees
Partitions, diophantine equations, and control systems
An algorithm for a merge recognition problem
Improper odd coloring of IC-planar graphs
A class of heuristics for the constrained forest problem
Discrete models for data imputation
A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms
On the edge-connectivity and restricted edge-connectivity of a product of graphs
Resistance distances and Kirchhoff index of graphs with an involution
Universal sequences for complete graphs
On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching
Modeling and simulation of metabolic networks for estimation of biomass accumulation parameters
Collapsible graphs and Hamiltonian connectedness of line graphs
Group inverse of the Laplacian of connections of networks
Bounds relating the weakly connected domination number to the total domination number and the matching number
A new complete language for DSPACE(log n)
A characterization of dissimilarity families of trees
Difference between 2-rainbow domination and Roman domination in graphs
Automorphism group of a graph related to zero-divisor graphs
The connection between polynomial optimization, maximum cliques and Turán densities
Scheduling workover rigs for onshore oil production
The maximum vertex coverage problem on bipartite graphs
On the Structure of Graphs with Few P 4 s
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices
Optimal L ( d , 1)-labelings of certain direct products of cycles and Cartesian products of cycles
Using semidirect products of groups to build classes of interconnection networks
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Charging station placement for limited energy robots
On certain trees with the same degree sequence
A magic rectangle set on Abelian groups and its application
Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index
Lopsided Lovász Local Lemma and Latin transversals
Approximating the Weight of Shallow Steiner Trees
Bisection Width of Transposition Graphs
On the approximability of the Simplified Partial Digest Problem
On 4-connected Claw-free Well-covered Graphs
Algorithms for linear time reconstruction by discrete tomography II
Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method
Tree-Width, Path-Widt, and Cutwidth
L(p, q)-labelings of subdivisions of graphs
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Differential property of Present-like structure
Asymptotically optimal erasure-resilient codes for large disk arrays
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results
Discrete rigid registration: A local graph-search approach
Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems
Network descriptors based on betweenness centrality and transmission and their extremal values
The Steiner Ratio of lamda d 2k
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks
Random Walks with Absorbing Points
Optimal layouts on a chain ATM network
On irreversibility of von Neumann additive cellular automata on grids
Weighted Fractional and Integral K-matching in Hypergraphs
Families of integral trees with diameters 4, 6, and 8
Competitive subset selection with two agents
Generalised Ramsey numbers for two sets of cycles
Spanning tree with lower bound on the degrees
Null and non-rainbow colorings of projective plane and sphere triangulations
On three blocks paths P(k, l, r)
The Proper Linear Spaces on 17 Points
Distributed computation of virtual coordinates for greedy routing in sensor networks
The existence and upper bound for two types of restricted connectivity
Algorithms for linear time reconstruction by discrete tomography
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs
A sharp lower bound of the Randic index of cacti with r pendants
Wiener index versus Szeged index in networks
König graphs for 3-paths and 3-cycles
Cryptanalysis of stream cipher LIZARD using division property and MILP based cube attack
On the third largest eigenvalue of eccentricity matrices of graphs
Hamiltonicity and bipancyclicity of balanced bipartite digraphs
The α-index of graphs without intersecting triangles/quadrangles as a minor
Enumeration of Acyclic Walks in a Graph
Extremal graphs for blow-ups of stars and paths
A Note on the Number of Perfect Matchings of Bipartite Graphs