yusuke1997/dblp-id-title huggingface dataset:
On the approximability of average completion time scheduling under precedence constraints
A competitive algorithm to find all defective edges in a graph
Expansion of layouts of complete binary trees into grids
Hamiltonian and long cycles in bipartite graphs with connectivity
On the average shape of monotonically labelled tree structures
An independent set approach for the communication network of the GPS III system
Paired-domination in claw-free graphs with minimum degree at least three
Augmented nodal matrices and normal trees
Higher dimensional restricted lattice paths with diagonal steps
On extremal cacti with respect to the revised Szeged index
On Frieze's χ(3) limit for lengths of minimal spanning trees
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques
On the locating chromatic number of Kneser graphs
Robust two-dose vaccination schemes and the directed b-matching problem
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
A bijection for the total area of parallelogram polyominoes
On an application of convexity to discrete systems
Exchange properties of combinatorial closure spaces
Anonymous Secret Sharing Schemes
Adjoining to (s, t)-Wythoff's game its P-positions as moves
Signless Laplacian spectral conditions for extremal quadrilateral and star embeddings
Cops and robbers in graphs with large girth and Cayley graphs
Biprobabilistic values for bicooperative games
1-factor covers of regular graphs
An Efficient Matching Algorithm Applied in Statistical Physics
Edge contractions in subclasses of chordal graphs
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number
Joint Performance of Greedy Heuristics for the Integer Knapsack Problem
Regular graphs with equal matching number and independence number
Search problems for two irregular coins with incomplete feedback: the underweight model
Collapsible graphs and Hamilton cycles of line graphs
Some Cayley graphs for simple groups
Numerical characterization of n-cube subset partitioning
Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
The number of spanning trees in Apollonian networks
A characterization of double Roman trees
MAX for k-independence in multigraphs
Smallest independent dominating sets in Kronecker products of cycles
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs
The expected subtree number index in random polyphenylene and spiro chains
Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution
On the Roman domination in the lexicographic product of graphs
Pancyclicity and NP-completeness in Planar Graphs
Algorithms to approximately count and sample conforming colorings of graphs
The resistance perturbation distance: A metric for the analysis of dynamic networks
A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags
A theoretical investigation on the distinguishers of Salsa and ChaCha
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Some formulations for the group steiner tree problem
Improved bounds for acyclic chromatic index of planar graphs
Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled
Cut, Paste, Filter
On generalized Turán number of graphs with bounded matching number
Necessary conditions for multistationarity in discrete dynamical systems
Multi-terminal multipath flows: synthesis
On vertices of outdegree k in minimally k-arc-connected digraphs
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Agent-based randomized broadcasting in large networks
On two intersecting set systems and k-continuous boolean functions
Schedules with a single preemption on uniform parallel machines
A Branch-and-Cut algorithm for graph coloring
The trees with the second smallest normalized Laplacian eigenvalue at least
Right Invariant Metrics and Measures of Presortedness
On the forbidden induced subgraph probe and sandwich problems
Poonen's conjecture and Ramsey numbers
Discovering all associations in discrete data using frequent minimally infrequent attribute sets
Fullerenes with the maximum Clar number
Cubic and quartic net-regular strongly regular signed graphs
Parallel Algorithms for the Domination Problems in Trapezoid Graphs
Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure
Percolation centrality via Rademacher Complexity
Semigroup automaton structure by homomorphism and domain partition
Plane elementary bipartite graphs
Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming
Characterization of expansion-related properties of modular graphs
Characterizations of competition multigraphs
On approximation intractability of the path-distance-width problem
Note on the m-step competition numbers of paths and cycles
Joint equidistributions of mesh patterns 123 and 132 with minus antipodal shadings
New permutation statistics: Variation and a variant
Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit
Exact Classification with Two-layer Neural Nets in N Dimensions
On cross-2-intersecting families
Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems
New bounds for the probability that at least k-out-of-n events occur with unimodal distributions
Edge addition and the change in Kemeny's constant
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12
On quasi-monotonous graphs
Quadratization of symmetric pseudo-Boolean functions
Complexity results for two kinds of conflict-free edge-coloring of graphs
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
Rainbow vertex k -connection in graphs
Flexibility of planar graphs without C4 and C5
Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
A polyhedral study of the maximum stable set problem with weights on vertex-subsets
Preface: LAGOS'19 - X Latin and American Algorithms, Graphs, and Optimization Symposium - Belo Horizonte, Minas Gerais, Brazil
Resistance distance and the normalized Laplacian spectrum
The packing coloring of distance graphs D(k, t)
Sharp bounds on the inverse sum indeg index
Multicolor routing in the undirected hypercube
On the generating functions and special functions associated with superoscillations
On the Complexity of a Special Basis Problem in LP
Binary set systems and totally balanced hypergraphs
Minimum decomposition of a digital surface into digital plane segments is NP-hard
The S-labeling problem: An algorithmic tour
Some combinatorial identities via Fibonacci numbers
Characterization of Test-sets for Overlap-free Morphisms
Efficient q-ary immutable codes
Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
Totally balanced and totally unimodular matrices defined by center location problems
Supereulerian of regular matroids with cogirth conditions
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree
A class of greedy algorithms for the generalized assignment problem
Subnetwork reliability analysis of star networks
The target location function on finite trees
Sandpiles and order structure of integer partitions
On the construction of locally most reliable two-terminal graphs
Classification of a class of distance-regular graphs via completely regular codes
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
On polynomial kernelization for Stable Cutset
The existence of f-forests and f-trees in graphs
Discrete-Euclidean operations
Approximation algorithms for multi-parameter graph optimization problems
Two infinite families of critical clique-Helly graphs
The independence polynomial of rooted products of graphs
Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
Designing algorithms by sampling
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
Essential points of the n-cube subset partitioning characterisation
Circulant TSP: Vertices of the edge-length polytope and superpolynomial lower bounds
On the difference between the (revised) Szeged index and the Wiener index of cacti
Vertex covers and eternal dominating sets
Metric k-median clustering in insertion-only streams
Motif discovery by monotone scores
Exact square coloring of subcubic planar graphs
Some Constacyclic Codes Over Z 2 k and Binary Quasi-cyclic Codes
Allocation of indivisible items with individual preference graphs
A note on minimal triangulations of an n-cube
On set expansion problems and the small set expansion conjecture
Minimum matrix representation of closure operations
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
Solving vertex coloring problems as maximum weight stable set problems
On the Equivalence Between Roof Duality and Lagrangian Duality for Unconstrained 0-1 Quadratic Programming Problems
Vertex splitting and the recognition of trapezoid graphs
Convex hulls of superincreasing knapsacks and lexicographic orderings
Computing the number of cubic runs in standard Sturmian words
Additive Similarity Measures
Characterization of graphs and digraphs with small process numbers
Sharp bounds of the zeroth-order general Randic index of bicyclic graphs with given pendent vertices
Convex dominating sets in maximal outerplanar graphs
Super Edge-Connectivity of Dense Digraphs and Graphs
Extension of Hereditary Classes with Substitutions
Catching an infinitely fast robber on a grid
The harmonic index of a graph and its DP-chromatic number
A note on off-line machines with 'brownian' input heads
Games, Equations and Dot-Depth Two Monoids
New classes of facets of the cut polytope and tightness of I mm22 Bell inequalities
A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs
Genetic relationship between Kangal, Akbash and other dog populations
Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
Efficient synthesis of a class of Boolean programs from I-O data: Application to genetic networks
Solving some NP-complete problems using split decomposition
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits
A note on the packing chromatic number of lexicographic products
Equitable colorings of Kronecker products of graphs
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs
Fluctuation Bounds for Sock-sorting and Other Stochastic Processes
On spectral extrema of graphs with given order and dissociation number
On the complexity of suboptimal decoding for list and decision feedback schemes
Exact and approximate results on the least size of a graph with a given degree set
Computing square roots of graphs with low maximum degree
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
On recognition of threshold tolerance graphs and their complements
Strengthened Ore conditions for (s, t)-supereulerian graphs
Weighted efficient domination for P8-free bipartite graphs in polynomial time
A simple PTAS for weighted matroid matching on strongly base orderable matroids
Multiprocessor scheduling: combining LPT and MULTIFIT
Factorization of symmetric circulant matrices in finite fields
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm
An effective formula for the number of solutions of a system of two 0, 1-equations
A New Exact Algorithm for the Solution of Quadratic Assignment Problems
The k-edge intersection graphs of paths in a tree
Identifying codes of corona product graphs
Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications
On the monotone likelihood ratio property for the convolution of independent binomial random variables
Maximal independent sets in the covering graph of the cube
Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter
Bicyclic graphs with maximal edge revised Szeged index
Limits of theory sequences over algebraically closed fields and applications
None of the coronoid systems can be isometrically embedded into a hypercube
On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
Vertex-minor reductions can simulate edge contractions
Perfect triple Roman domination
Graph clustering with Boltzmann machines
Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
A short constructive proof of A. R. Rao's characterization of potentially K r+1 -graphic sequences
Constructing totally disjoint spectra plateaued functions and searching five-value spectrum functions in odd variables
On platypus graphs and the Steiner-Deogun property
Virtual network embedding in the cycle
Distance domination, guarding and covering of maximal outerplanar graphs
A note on morphic characterization of languages
Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
Counting humps in Motzkin paths
Approximations of Lovász extensions and their induced interaction index
Haplotyping with missing data via perfect path phylogenies
Computing the Throughput of a Network with Dedicated Lines
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
Resistance distances in Cayley graphs on symmetric groups
Recognition of Some Perfectly Orderable Graph Classes
Easy and hard instances of arc ranking in directed graphs
The asymptotic behavior of (degree-)Kirchhoff indices of iterated total graphs of regular graphs
The matching energy of graphs with given parameters
Coprime networks of the composite numbers: Pseudo-randomness and synchronizability
4-cop-win graphs have at least 19 vertices
Scheduling Imprecise Computation Tasks with 0/1-constraint
Embedding ladders and caterpillars into the hypercube
3D-interval-filament graphs
On a bidirected relaxation for the MULTIWAY CUT problem
Ramsey number of K3 versus F3, n
A note on secure domination number in 2K2-free graphs
Biclique graphs of interval bigraphs
Computing the minimum number of hybridization events for a consistent evolutionary history
Bounds for short covering codes and reactive tabu search
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
Minimal arc-sets spanning dicycles
Polynomial-time data reduction for weighted problems beyond additive goal functions
On k nearest points of a finite set in a normed linear space
Path problems in generalized stars, complete graphs, and brick wall graphs
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
(2+f(n))-SAT and its properties
Embedding finite involution semigroups in matrices with transposition
The Complexity of some Problems Related to Graph 3-colorability
On "Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs" from IEEE IoT journal
Sensitivity Analysis of the Economic Lot-Sizing Problem
Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization
The hamiltonicity and path t-coloring of Sierpiński-like graphs
Cooperative games with restricted formation of coalitions
More on the one-dimensional sliding-coin puzzle
Some sufficient conditions for graphs to be k-leaf-connected
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
On the b-chromatic number of regular graphs without 4-cycle
On Cutting a Few Vertices from a Graph
On the Chromatic Number, Colorings, and Codes of the Johnson Graph
On the average similarity degree between solutions of random k-SAT and random CSPs
A solvable case of quadratic 0-1 programming
Domination and dominator colorings in planar graphs with small diameter
On degree resistance distance of cacti
Pareto optima for total weighted completion time and maximum lateness on a single machine
Reconfiguration graphs of zero forcing sets
Completely unimodal numberings of a simple polytope
A new family of proximity graphs: Class cover catch digraphs
Bounds on the connected domination number of a graph
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding
Embedding Trees in Recursive Circulants
The Efficiency of AC Graphs
The complexity of a periodic sequence over GF(p)
An implicit representation of chordal comparability graphs in linear time
Complete bipartite graphs without small rainbow stars
The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
The rank-width of the square grid
On equienergetic signed graphs
Multiterminal duality and three-terminal series-parallelness
Monochromatic disconnection of graphs
Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces
The Shifting Algorithm Technique for the Partitioning of Trees
Critical and maximum independent sets of a graph
q-cube enumerator polynomial of Fibonacci cubes
The Asymmetric Median Tree - A New Model for Building Consensus Trees
On positive and negative atoms of Cayley digraphs
A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables
Fault-tolerant detectors for distinguishing sets in cubic graphs
The generalized connectivity of alternating group graphs and (n, k)-star graphs
Games on concept lattices: Shapley value and core
The complexity of completing partial Latin squares
on Component-size Bounded Steiner Trees
Group parking permit problems
Bicyclic signed graphs with at most one odd cycle and maximal energy
The advantage of truncated permutations
On the construction of most reliable networks
Efficient algorithms and codes for k-cardinality assignment problems
Calculating growth rates and moments for additive cellular automata
Cliques That Are Tolerance Digraphs
Orientable total domination in graphs
On the characterization of the domination of a diameter-constrained network reliability model
Using exploratory analyses to select judges and create the components of a naming test to study aphasia
Minimum multiple originator broadcast graphs
How Good Are Branching Rules in DPLL?
A decomposition of the space of TU-games using addition and transfer invariance
Some results on the saturation number of graphs
An O(n log 2 n) algorithm for the optimal sink location problem in dynamic tree networks
Partitioning the vertices of a cubic graph into two total dominating sets
Monitoring the edges of a graph using distances
Optimal open-locating-dominating sets in infinite triangular grids
Optimal pebbling number of graphs with given minimum degree
A (B+1)-approximation for network flow interdiction with unit costs
Decomposition width of matroids
Positive circuits and maximal number of fixed points in discrete dynamical systems
Untangling planar graphs from a specified vertex position - Hard cases
On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2
Net Laplacian controllability for joins of signed graphs
Construction of binary and ternary self-orthogonal linear codes
On group-valued potential differences and flows in a signed graph
DP-4-colorability of planar graphs without adjacent cycles of given length
A competitive algorithm in searching for many edges in a hypergraph
( t , r ) -Broadcast Domination in graphs
Weighted digital distance transforms in four dimensions
Counting inversion sequences by parity successions and runs
Asteroidal triples of moplexes
The number of convex polyominoes and the generating function of Jacobi polynomials
Removable and forced subgraphs of graphs
Conversion of coloring algorithms into maximum weight independent set algorithms
Average number of occurrences of repetitions in a necklace
Minimal obstructions to (s, 1)-polarity in cographs
On the colored Tutte polynomial of a graph of bounded treewidth
On approximability of minimum color-spanning ball in high dimensions
Diagnosis of constant faults in read-once contact networks over finite bases
Radial Moore graphs of radius three
Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection
Acyclic coloring of claw-free graphs with small degree
Worst case behavior of the steepest edge simplex method
Constructing two-weight codes with prescribed groups of automorphisms
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
Parabolic target space and primal-dual interior-point methods
Branch-and-cut approaches for p-Cluster Editing
A revision and extension of results on 4-regular, 4-connected, claw-free graphs
On Powers of Circular Arc Graphs and Proper Circular Arc Graphs
Rough analysis of computation trees
On minimum matrix representation of closure operations
Conditions for the existence of solutions of the three-dimensional planar transportation problem
Internet routing between autonomous systems: Fast algorithms for path trading
On Intervalizing K-colored Graphs for DNA Physical Mapping
On the eigenvalues and Seidel eigenvalues of chain graphs
A Note on Generalizing the Maximum Lateness Criterion for Scheduling
Revisiting Takagi-Lim et al. family schemes
Landmarks in Graphs
Roman domination and independent Roman domination on graphs with maximum degree three
Minimal obstructions to 2-polar cographs
Non-inclusive diagnosability of folded hypercube-like networks
Generalized roof duality
Neighborhood unions and cyclability of graphs
On the maximum sigma index of k-cyclic graphs
Reducing regular graphs to partition their vertices into a total dominating set and an independent dominating set
A Study of the Cyclic Scheduling Problem on Parallel Processors
Sphere-separable partitions of multi-parameter elements
On semi-transitive orientability of circulant graphs
The number of spanning trees in Km,n-complements of bipartite graphs
Bubblesort, stacksort and their duals
On the harmonic index and the chromatic number of a graph
Tutte's dichromate for signed graphs
Fair integral submodular flows
k-Connectivity and Decomposition of Graphs into Forests
On the complexity of the dominating induced matching problem in hereditary classes of graphs
Exchanges procedures for timetabling problems
On the structure of Skipjack
Probabilistic chip-collecting games with modulo winning conditions
Application of an optimization problem in Max-Plus algebra to scheduling problems
Vertex-degree based topological indices of digraphs
Recognizing near-bipartite Pfaffian graphs in polynomial time
Weak saturation number for multiple copies of the complete graph with a star removed
A weak DP-coloring of planar graphs without 4- and 9-cycles
Bounds for the probability of union of events following monotonic distribution
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
The extendability of Cayley graphs generated by transpositions
An Algorithm for Finding Homogeneous Pairs
Applications of edge coverings by cliques
On the existence of retransmission permutation arrays
The iterated local transitivity model for hypergraphs