yusuke1997/dblp-id-title huggingface dataset:
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
A note on the Steiner k-radius and Steiner k-diameter
Constrained Weighted Matchings and Edge Coverings in Graphs
Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
Querying relational event graphs using colored range searching data structures
The Solitaire Clobber game and correducibility of graphs
Clique-width of full bubble model graphs
Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time
Regularity of Matrices in Min-algebra and Its Time- Complexity
Maximum energy bicyclic graphs containing two odd cycles with one common vertex
The general sigma all-ones problem for trees
Complexity of Searching an Immobile Hider in a Graph
Large Generalized Cycles
Recognizing DNA graphs is difficult
Automated generation of conjectures on forbidden subgraph characterization
Fine-grained forward-secure signature schemes without random oracles
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond
Recalling Leo
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
Preface: 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019)
Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays
On the Depth of Combinatorial Optimization Problems
Self-spanner graphs
Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
Algorithmic aspects of switch cographs
Construction of sports schedules with multiple venues
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs
On minimum degree, leaf number, traceability and Hamiltonicity in graphs
On strong unimodality of multivariate discrete distributions
Almost every graph is divergent under the biclique operator
Approximations to clustering and subgraph problems on trees
Characterization of graphs with the limited normalized algebraic connectivity
A distance approximating trees
Visualization of quasi-median networks
A Fixed Point Operator for the Generalised Maximum Satisfiability Problem
Variations of largest rectangle recognition amidst a bichromatic point set
Clawfreeness of the powers of a graph
Inertia and distance energy of line graphs of unicyclic graphs
An extremal problem on non-full colorable graphs
A (1/2+1/60) - Approximation algorithm for Maximum Weight Series-Parallel Subgraph
Edge Disjoint Polyp Packing
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
Radio labelings of distance graphs
Strong matching preclusion for k-ary n-cubes
The proof theoretic strength of the Steinitz exchange theorem
Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
Total domination in inflated graphs
Characterization of double domination subdivision number of trees
Hamilton-connected claw-free graphs with Ore-degree conditions
Graph minor hierarchies
On the maximum cardinality search lower bound for treewidth
A Constructive Proof for the Induction of M-convex Functions through Networks
Matroid optimization with Generalized Constraints
On acyclic systems with minimal Hosoya index
Degree sums and proper connection number of graphs
The graph energy game
Amenable Colorings
Analysis of Low Hamming Weight Products
The Combinations of Resistances
The variation of the Randić index with regard to minimum and maximum degree
The Complexity of Domination Problems in Circle Graphs
Facial disjunctive programs and sequence of cutting-planes
On rainbow total-coloring of a graph
Increasing digraph arc-connectivity by arc addition, reversal and complement
On probe permutation graphs
Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles
Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters
Strict optimal rubbling of graphs
Upper bound of the list r-hued chromatic number
Screw discrete dynamical systems and their applications to exact slow NIM
Finding sharper distinctions for conditions of transitivity of the majority method
Novel bilevel formulations for waste management
Unrooted non-binary tree-based phylogenetic networks
Optimal constructions of reversible digraphs
A polyhedral investigation of star colorings
Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
Parikh word representability of bipartite permutation graphs
On Variations of the Subset Sum Problem
Probabilistic performance of a heuristic for the satisfiability problem
Efficient (t, r) broadcast dominating sets of the triangular lattice
Maximum path digraphs
A Brief Survey of Perfect Mendelsohn Packing and Covering Designs
The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain
On the bipartite graph packing problem
Simpler proof for nonlinearity of majority function
Locally defined independence systems on graphs
Fractional routing using pairs of failure-disjoint paths
A nonfactorial algorithm for testing isomorphism of two graphs
On the variance of the external path length in a symmetric digital trie
Structure of some ( P7, C4)-free graphs with application to colorings
Computational complexity of covering disconnected multigraphs
One-to-many node-disjoint paths in (n, k)-star graphs
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem
Hardness transitions of star colouring and restricted star colouring
On random multi-dimensional assignment problems
The Brown-Erdős-Sós conjecture in finite abelian groups
A note on the similarity depth
The bisection width and the isoperimetric number of arrays
Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues
Approximation algorithms for the shortest total path length spanning tree problem
On the Stability Number of Claw-free P 5 -free and More General Graphs
On the edge-Szeged index of unicyclic graphs with perfect matchings
Hamiltonian cycles in spanning subgraphs of line graphs
A characterization of the non-trivial diameter two graphs of minimum size
Homomorphic extensions of CRT-based secret sharing
Coulson-type integral formulas for the general (skew) Estrada index of a vertex
On digital plane preimage structure
On the intersection of tolerance and cocomparability graphs
Orthogonal double covers of general graphs
Multiplicity of eigenvalues of cographs
Frustration and isoperimetric inequalities for signed graphs
On the number of generators for transeunt triangles
A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3
Self-avoiding closed curves in the regular and semiregular grids
The hamiltonicity of quasi-random k-graphs
An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic
Reducible Configurations for the Cycle Double Cover Conjecture
On the equivalence of cylinder tilings and planar electric networks
Hereditary dominating pair graphs
Adaptive group testing with a constrained number of positive responses improved
A Primal Dual Integer Programming Algorithm
Corrigendum to "The distance spectral radius of digraphs": [Discrete Appl. Math. 161 (2013) 2537-2543]
A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture
Complexity-separating graph classes for vertex, edge and total colouring
Lit-only sigma-game on pseudo-trees
Biclique-colouring verification complexity and biclique-colouring power graphs
Uniqueness of maximum scores in countable-outcome round-robin tournaments
Infinitesimal rigidity and prestress stability for frameworks in normed spaces
Global offensive alliances in graphs and random graphs
On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
Weighted geometric set cover with rectangles of bounded integer side lengths
Cyclically permutable representations of cyclic codes
On non-repetitive complexity of Arnoux-Rauzy words
Text searching allowing for inversions and translocations of factors
Wiener index versus maximum degree in trees
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
Spectral spread and trace norm of eccentricity matrix of graphs
Order statistics and estimating cardinalities of massive data sets
Transferable domination number of graphs
On the diameter of hypercubes with star structure faults
Tilted inequalities and facets of the set covering polytope: A theoretical analysis
A note on k-metric dimensional graphs
On the existence problem of the total domination vertex critical graphs
Strict neighbor-distinguishing index of outerplanar graphs
Square roots of minor closed graph classes
Four-searchable biconnected outerplanar graphs
When Lagged Fibonacci Generators jump
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
Irregularities of maximal k-degenerate graphs
Rich words in the block reversal of a word
Valid constraints for the Point Packing in a Square problem
Reliable broadcasting in product networks
A new property of the Lovász number and duality relations between graph parameters
Bounds on the defect of an octahedron in a rational lattice
3/2 firefighters are not enough
Recursion orders for weights of Boolean cubic rotation symmetric functions
Parallel machines scheduling with nonsimultaneous machine available time
Linear-time modular decomposition of directed graphs
Decomposition of planar graphs with forbidden configurations
On data classification by iterative linear partitioning
The train marshalling problem
h -Assignments of simplicial complexes and reverse search
A branch-and-cut-and-price approach for the capacitated m-ring-star problem
Permuting operations on strings and their relation to prime numbers
Metric dimension and pattern avoidance in graphs
A note on the Grundy number and graph products
Restricted arc-connectivity in tournaments
Minimum degree algorithms for stability number
On two-stage stochastic knapsack problems
The harmonious coloring problem is NP-complete for interval and permutation graphs
Relations between degree-based graph invariants
An analysis of root functions - A subclass of the Impossible Class of Faulty Functions (ICFF)
Schedule-induced posets
Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing
Regular pattern-free coloring
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
Special Issue dedicated to Workshop on Graph Spectra, Combinatorics and Optimization (WGSCO2018), Aveiro, Portugal, January 2018
Decision trees with minimum average depth for sorting eight elements
On well-covered pentagonalizations of the plane
First-Fit coloring of bounded tolerance graphs
Metric dimension: From graphs to oriented graphs
On the extremal values of the eccentric distance sum of trees with a given maximum degree
Finding Degeneracies Among Sets of Lines
A note on the occupational degeneracy for dimers on a saturated two-dimensional lattice space
The balanced connected subgraph problem
Simplifying maximum flow computations: The effect of shrinking and good initial flows
Domination game on uniform hypergraphs
A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems
Fibonacci and Lucas p-cubes
An efficient algorithm for vertex enumeration of arrangement
Parameterized and exact algorithms for class domination coloring
Approximating the fixed linear crossing number
K5, 5 is fully reconstructible in ℂ3
A simplified algorithm computing all s-t bridges and articulation points
Avoiding-sequences with minimum sum
Graph editing to a fixed target
Finding a mediocre player
List rankings and on-line list rankings of graphs
Structure connectivity and substructure connectivity of star graphs
Several polynomials associated with the harmonic numbers
Investigating the recoverable robust single machine scheduling problem under interval uncertainty
Maximal hypercubes in Fibonacci and Lucas cubes
Induced disjoint paths problem in a planar digraph
Unital designs with blocking sets
Primal and dual combinatorial dimensions
The cyclic diagnosability of star graphs under the PMC and MM* models
Maximum cuts in edge-colored graphs
Unbordered partial words
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
On graphs with the maximum edge metric dimension
On the construction of prefix-free and fix-free codes with specified codeword compositions
Uniqueness and reconstruction of finite lattice sets from their line sums
On the van der Waerden numbers w(2; 3, t)
Dual-bounded generating problems: weighted transversals of a hypergraph
The Asian contribution to the Turkish population with respect to the Balkans: Y-chromosome perspective
On the interval completion of chordal graphs
Diameter-vulnerability of Large Bipartite Digraphs
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
Girth of {C 3 , ..., C s }-free extremal graphs
Monochromatic graph decompositions inspired by anti-Ramsey colorings
One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences
Conflict-free coloring of unit disks
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs
General Vertex Disjoint Paths in Series-Parallel Graphs
Optimal binary codes from trace codes over a non-chain ring
Erratum: Binary Vectors with Exactly k Nonoverlapping m -Tuples of Consecutive ones
Efficiently enumerating minimal triangulations
Nearly on Line Scheduling of Preemptive Independent Tasks
Comment on "Kirchhoff index in line, subdivision and total graphs of a regular graph"
Characterizing extremal graphs for open neighbourhood location-domination
(2, 1)-total labeling of trees with large maximum degree
Algorithms for Radon partitions with tolerance
The leaf-free graphs with nullity 2c(G)-1
The symmetry-moderated Wiener index of truncation graph, Thorn graph and Caterpillars
Trees, Congruences and Varieties of Finite Semigroups
Characterizations of graphs with equal vertex and coalition number
Online scheduling with machine cost and rejection
Counting and coding identity trees with fixed diameter and bounded degree
Uniform homomorphisms of de Bruijn and Kautz networks
Cycle intersection in spanning trees: A shorter proof of a conjecture and applications
Infection in hypergraphs
A Sequencing Problem with Family Setup Times
Edge weights and vertex colours: Minimizing sum count
On an interpolation property of outerplanar graphs
A simple algorithm and min-max formula for the inverse arborescence problem
A maxmin problem on finite automata
Spanning cactus: Complexity and extensions
Cacti with maximum eccentricity resistance-distance sum
on-line Algorithms for ordered Sets and Comparability Graphs
Bi-cycle extendable through a given set in balanced bipartite graphs
Finding and listing induced paths and cycles
Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs
Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
Pure 2D picture grammars and languages
Bilinear maps and graphs
lambda-Coloring matrogenic graphs
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
Intervertex Distances in Convex Polygons
Initial non-repetitive complexity of infinite words
r-hued coloring of sparse graphs
Tightly coupled multi-group threshold secret sharing based on Chinese Remainder Theorem
On "The Matching Polynomial of a Polygraph"
Local WL invariance and hidden shades of regularity
k-Rainbow domatic numbers
Distance spectral spread of a graph
Leafy spanning arborescences in DAGs
On the complexity of computing the temporal hybridization number for two phylogenies
Open problems around exact algorithms
Spanning tree enumeration and nearly triangular graph Laplacians
Are hitting formulas hard for resolution?
Prime power and prime product distance graphs
A new LBFS-based algorithm for cocomparability graph recognition
Perfect out-forest problem and directed Steiner cycle packing problem
Synchronizing sequences for road colored digraphs
A new generalization of kernels in digraphs
Solving all-pairs shortest path by single-source computations: Theory and practice
Goppa-like Bounds for the Generalized Feng-Rao Distances
On non-rank facets of stable set polytopes of webs with clique number four
Maximum independent sets near the upper bound
Optimality for the restricted edge connectivity in exchanged ternary n-cubes
The goodness of {S, a}-EOL forms is decidable
Balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
On r-acyclic edge colorings of planar graphs
Partitions of Zm with identical representation functions
Lower bounds on paraclique density
On the geodeticity of the contour of a graph
VC-dimension and pseudo-random graphs
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Cyclic Codes Over Z 4 of Oddly Even Length
On graceful colorings in subcubic trees
On the roots of independence polynomials of almost all very well-covered graphs
The Kirchhoff indexes of some composite networks
Expected Complexity of Graph Partitioning Problems
Strong Regularity of Matrices - A Survey of Results
Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem
Center location problems on tree graphs with subtree-shaped customers
New bounds on binary identifying codes
Palindromic factorization of rich words
Some results on k-critical P5-free graphs
Topological optimization with a network reliability constraint
Equitable total coloring of complete r-partite p-balanced graphs
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs
Unions of digraphs which become kernel perfect
A New Class of Nonbinary Codes Meeting the Griesmer Bound
The t-discrepancy of a poset
Augmenting the algebraic connectivity for certain families of graphs
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
How much is it worth to know the future in online conversion problems?
Detour trees
Algorithms for computing Abelian periods of words
On-line list coloring of matroids
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
A note on Hamilton ℓ-cycle decomposition of complete k-partite hypergraphs
Optimal receiver scheduling algorithms for a multicast problem
q-derivative operator proof for a conjecture of Melham
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
Minimum cost noncrossing flow problem on layered networks
Packing and domination parameters in digraphs
Generating minimal redundant and maximal irredundant subhypergraphs
Fixed cardinality stable sets
Distance and distance signless Laplacian spread of connected graphs
Cyclic games and linear programming
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
On colorings of the Boolean lattice avoiding a rainbow copy of a poset
Reconstructing a History of Recombinations From a Set of Sequences
The sum choice number of P 3 P n
Lower bounds for optimal alignments of binary sequences
On exclusion regions for optimal triangulations
Factoring Boolean functions using graph partitioning
Non-inclusion and other subclasses of chordal graphs
An elementary digital plane recognition algorithm
Torus-like graphs and their paired many-to-many disjoint path covers
Competition Numbers of Graphs with a Small Number of Triangles
Functions that are Read-Once on a Subset of their Inputs
On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory
Empirical analysis of algorithms for the shortest negative cost cycle problem
Polyhedral Graphs Without Hamiltonian Cycles
A combinatorial formula for the Schur coefficients of chromatic symmetric functions
The ɛ-spectral radius of trees with perfect matchings
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada
The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
A local maximizer for lattice width of 3-dimensional hollow bodies
The integrity of a cubic graph
Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
Polynomial algorithms for restricted Euclidean p-centre problems
Bounded-hops power assignment in ad hoc wireless networks
Biconvex graphs: ordering and algorithms
Hardness of identifying the minimum ordered binary decision diagram
On implicational bases of closure systems with unique critical sets
The numbers of repeated palindromes in the Fibonacci and Tribonacci words
Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles)
Fractional matching preclusion for arrangement graphs
Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007
Covering with Latin Transversals
Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3)
Maker-Breaker total domination game
Selective dynamic compression
Zero forcing propagation time on oriented graphs
Superdominance order and distance of trees with bounded maximum degree
Extremal graphs with respect to generalized ABC index
Lexicographic ranking and unranking of derangements in cycle notation
Matching extension and matching exclusion via the size or the spectral radius of graphs
Some Results About Normal Forms for Functional Dependency in the Relational Datamodel
Common domination perfect graphs
On the bitprobe complexity of two probe adaptive schemes
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
Complexity of total outer-connected domination problem in graphs
Regular intersecting families
Computational complexity aspects of point visibility graphs
The structure of stable marriage with indifference
New approaches to reduced-complexity decoding
Characterizations and Algorithmic Applications of Chordal Graph Embeddings
Dichotomizing k-vertex-critical H-free graphs for H of order four
Probabilistic properties of highly connected random geometric graphs
On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes
The Complementary Class of Generalized Flow Cover Inequalities
On chordal graph and line graph squares
On spanning subgraphs of 4-connected planar graphs
Cut Invariant D and Bond orders of Kekuléan Benzenoids
Matchings in pentagonal chains
List matrix partitions of graphs representing geometric configurations
A note on the integrity of grids
Fibonacci-run graphs II: Degree sequences
A survey and classification of Sierpiński-type graphs
Characterizations of graph classes via convex geometries: A survey
A -approximation for subcubic 2EC using circulations and obliged edges
Constrained partitioning problems
Unique representation in number systems and L codes
Recognizing k-path Graphs
A matching algorithm for regular bipartite graphs
On the packing chromatic number of subcubic outerplanar graphs
Uniform clutters and dominating sets of graphs
Bell polynomials and k-generalized Dyck paths
Investigations on autark assignments
Generalized fault-tolerance for enhanced hypercubes
on a Partition into Convex Polygons
On the exact size of maximum impulse radio sequences with parameters (m, k, λ, k-1)
A new algorithm for optimal multileaf collimator field segmentation
Existence of paths with t blocks in k(t)-chromatic digraph
On strongly context-free languages
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
Distance-related Invariants on Polygraphs
Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM