yusuke1997/dblp-id-title huggingface dataset:
On α-labellings of lobsters and trees with a perfect matching
A Survey of Integrity
A lower bound on the crossing number of uniform hypergraphs
The joint weight enumerator of an LCD code and its dual
On strong Menger-connectivity of star graphs
On a Multiconstrained Model for Chromatic Scheduling
Distant irregularity strength of graphs with bounded minimum degree
The Infinite Families of Optimal Double Loop Networks
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
On spectrum assignment in elastic optical tree-networks
A note on the covering radius of optimum codes
Twin-width of graphs with tree-structured decompositions
Acyclic edge coloring of planar graphs with girth at least 5
Simultaneous fuzzy segmentation of multiple objects
Fractional total colouring
On locating and neighbor-locating colorings of sparse graphs
Partial information in public key cryptography
Colorful edge decomposition of graphs: Some polynomial cases
A class of combinatorial identities
The vehicle routing problem with flexible time windows and traveling times
Tight bounds for bandwidth allocation on two links
On the difference of the domination number of a digraph and of its reverse
On the (h, k)-domination numbers of iterated line digraphs
Memory management optimization problems for integrated circuit simulators
Kernelization for feedback vertex set via elimination distance to a forest
General multiplicative Zagreb indices of trees
TC operations and Latin bricks
Two-dimensional strip packing with unloading constraints
Vertex types in threshold and chain graphs
Searching with mobile agents in networks with liars
Flow hypergraph reducibility
Upper bounds on the upper signed total domination number of graphs
Polynomial graph-colorings
Cutting out polygon collections with a saw
A note on extremal trees for a bound on the double domination number
On the degree Kirchhoff index of unicyclic graphs
Euclidean Steiner Minimal Trees, Minimum Energy Configurations, and the Embedding Problem of Weighted Graphs in E 3
Characterizing the Flow Equivalent Trees of a Network
Dating to Marriage
A satisfiability procedure for quantified Boolean formulae
A linearization framework for unconstrained quadratic (0-1) problems
Locating and total dominating sets in trees
A survey on rainbow (vertex-)index of graphs
On the Cut-off Point for Combinatorial Group Testing
The complexity of minimizing certain cost metrics for k-source spanning trees
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
A characterization of positive spanning sets with ties to strongly edge-connected digraphs
The maximum number of minimal codewords in long codes
The r-switching-stable graphs
Low complexity normal bases
Eigenvalue location in cographs
Incomparability in parallel computation
On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
On the stable set problem in special P 5 -free graphs
Co-TT graphs and a characterization of split co-TT graphs
On generalized zero divisor graph of a poset
Problem identification using program checking
Minimum time broadcast in faulty star networks
On interval representations of graphs
Digraphs whose m-step competition graphs have triangles
Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs
A Multifacility Location Problem on Median Spaces
Complexity of learning in concept lattices from positive and negative examples
Splicing semigroups of dominoes and DNA
Broadcasting in m-dimensional grid graphs with a given neighborhood template
Maxima of the Q-index of non-bipartite graphs: Forbidden short odd cycles
Idle regulation in non-clairvoyant scheduling of parallel jobs
On the double Roman domination in graphs
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
Linear CNF formulas and satisfiability
P5-isolation in graphs
On the α-index of minimally 2-connected graphs with given order or size
On graphs which can or cannot induce Chinese Postman games with a non-empty core
Graphs and digraphs represented by intervals and circular arcs
An improved algorithm for quantitative group testing
Parallel machine scheduling with splitting jobs
Polynomial Invariants of Graphs with State Models
On the kth smallest and kth greatest modified Wiener indices of trees
A Faster Algorithm to Recognize Undirected Path Graphs
The oriented chromatic number of the hexagonal grid is 6
Global edge alliances in graphs
Succinct data structures for bounded clique-width graphs
Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations
Triangulating Graphs with Few P 4 's
On the context-free production complexity of finite languages
Disjointness graphs of segments in R2 are almost all hamiltonian
On the maximum quasi-clique problem
Structure of the eigenspace of a Monge matrix in max-plus algebra
Cycle energy and its size dependence
A combinatorial algorithm for weighted stable sets in bipartite graphs
Some properties on eccentricity matrices of uniform hypertrees
Some properties and applications of odd-colorable -hypergraphs
A defect property of codes with unbounded delays
Numerical semigroups of Szemerédi type
A comparison of integer programming models for the partial directed weighted improper coloring problem
Maximum Resistance-Harary index of cacti
A homomorphic characterization of regular languages
Parsimonious Set Representations of Orders, a Generalization of the Interval Order Concept, and Knowledge Spaces
The lattice of embedded subsets
A push-relabel framework for submodular function minimization and applications to parametric optimization
Packing Problems in Edge-colored Graphs
On the Boolean connectivity problem for Horn relations
Broadcasts on paths and cycles
Extensions of results on phylogeny graphs of degree bounded digraphs
On the characterization of some algebraically defined bipartite graphs of girth eight
On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture
On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions
An asymmetric analogue of van der Veen conditions and the traveling salesman problem
Absolute Reflexive Retracts and Absolute Bipartite Retracts
Perfect double Roman domination of trees
Minimum-cost Line Broadcast in Paths
The strong ( 2 , 2 ) -Conjecture for more classes of graphs
Necessary solvability conditions of systems of linear extremal equations
Total domination cover rubbling
Set-reconstructibility of Post classes
Incremental delay enumeration: Space and time
Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
The covering radius of doubled 2-designs in 2O k
A note on the acyclic 3-choosability of some planar graphs
Reliability of m-ary n-dimensional hypercubes under embedded restriction
On the r, s-SAT satisfiability problem and a conjecture of Tovey
An approximation algorithm for the pickup and delivery vehicle routing problem on trees
Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices
Higher order connectivity index of starlike trees
The speed and threshold of the biased perfect matching and Hamilton cycle games
Identifying codes in the direct product of a complete graph and some special graphs
About the infinite windy firebreak location problem
A characterization of graphs of competition number m
Approximating a generalization of MAX 2SAT and MIN 2SAT
Extending some results on the second neighborhood conjecture
On conflict-free connection of graphs
On the complement graph and defensive k-alliances
Recognizing tough graphs is NP-hard
On the Nash number and the diminishing Grundy number of a graph
On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
Line broadcasting in cycles
A semi-systolic decoder for the PDSC-73 error-correcting code
On implication bases in n-lattices
Bichromatic P 4 -composition schemes for perfect orderability
Combinatorial approach of unified Apostol-type polynomials using α-distanced words
Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture
Frugal, acyclic and star colourings of graphs
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation
On constructing complete permutation polynomials over finite fields of even characteristic
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property
Some applications of algebra to combinatorics
The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
Disruption recovery at airports: Integer programming formulations and polynomial time algorithms
Fire containment in grids of dimension three and higher
The splitting technique in monotone recognition
Order-preserving, upward drawing of binary trees using fewer bends
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017)
Scheduling with release dates on a single machine to minimize total weighted completion time
Coherent domains and improved lower bounds for the maximum size of Condorcet domains
optimal Detection of a Counterfeit Coin with Multi-arms Balances
Characterize all C5-free diameter-2-critical graphs with at least ⌊(n-1)24⌋+1 edges
A framework for the greedy algorithm
Subnetwork reliability analysis in k-ary n-cubes
Sufficient sparseness conditions for G 2 to be (Δ+1)-choosable, when Δ≥5
On completing latin squares
Best reduction of the quadratic semi-assignment problem
Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4
List coloring in the absence of two subgraphs
Colorings of oriented planar graphs avoiding a monochromatic subgraph
Axiomatizing the Public Good Index via merging and new arrival properties
Exponential augmented Zagreb index of (n,m)-graphs
Langages sur des alphabets infinis
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems
Transversals and competition numbers of complete multipartite graphs
Computing the zig-zag number of directed graphs
Complexity and approximations for submodular minimization problems on two variables per inequality constraints
A competitive and cooperative approach to propositional satisfiability
Makespan optimization in a single-machine scheduling problem with dynamic job ready times - Complexity and algorithms
An analysis of the greedy algorithm for partially ordered sets
Substitutes and complements in network flow problems
Gender consistent resolving rules in marriage problems
Close-to-optimal and Near-optimal Broadcasting in Random Graphs
Nordhaus-Gaddum-type problems for lines in hypergraphs
Computational complexity of the recoverable robust shortest path problem with discrete recourse
Domination in direct products of complete graphs
k-path-connectivity of the complete balanced tripartite graph Kn,n,n for n+1≤k≤2n-4
A Poisson limit for the number of sub-matrices of random binary matrices satisfying the majority rule
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
Deterministic Communication Complexity of Set Intersection
Bounding Sample Size with the Vapnik-Chervonenkis Dimension
A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers
On the b-chromatic number of regular bounded graphs
Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
A parallel algorithm for constructing independent spanning trees in twisted cubes
The fast robber on interval and chordal graphs
On efficient domination for some classes of H-free chordal graphs
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs
Graph theoretic approach to parallel gene assembly
Brushing without capacity restrictions
The iterative independent model
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
New algorithms and bounds for halving pseudolines
A domain monotonicity theorem for graphs and Hamiltonicity
A local edge diagnosability measure for multiprocessor systems
Traveling salesman games with the Monge property
Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions
Universal algorithms for evaluating boolean functions
Coloring graphs characterized by a forbidden subgraph
Distance distributions for graphs modeling computer networks
Spectral extrema of F2-free graphs with given size revisited
Recent results on containment graphs of paths in a tree
Eigenvector-based identification of bipartite subgraphs
A greedy approximation algorithm for the group Steiner problem
Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats
A Graph Theoretical Approach for the Yield Enhancement of Reconfigurable VLSI/WSI Arrays
Covering and packing of triangles intersecting a straight line
Graph exploration by a deterministic memoryless automaton with pebbles
A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs
Hamiltonian circuits determining the order of chromosomes
The complexity of pebbling reachability and solvability in planar and outerplanar graphs
'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders
On the diameter and girth of zero-divisor graphs of posets
On variants of conflict-free-coloring for hypergraphs
On 3-uniform hypergraphs without a cycle of a given length
Forwarding and optical indices of a graph
Ordered Gallai-Ramsey numbers
Embedding of hypercubes into sibling trees
On orthogonal ray trees
Integral trees of diameter 6
Total domination dot-stable graphs
Substitutable choice functions and convex geometry
On the hardness of problems around s-clubs on split graphs
No-hole k-tuple (r+1)-distant Colorings
A polynomial-time algorithm for the paired-domination problem on permutation graphs
A result concerning the trios generated by commutative slip-languages
An introduction to parallelism in combinatorial optimization
Inversions in k-sorted Permutations
A linear-time algorithm for finding Hamiltonian cycles in tournaments
Sharp bounds for the Zagreb indices of bicyclic graphs with k-pendant vertices
Minimum strictly fundamental cycle bases of planar graphs are hard to find
On the power of circular splicing
Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7
Multidimensional cell lists for investigating 3-manifolds
Dynamic index and LZ factorization in compressed space
A further note on the stable matching problem
On shortening u-cycles and u-words for permutations
On the weak Roman domination number of lexicographic product graphs
γ-variable first-order logic of preferential attachment random graphs
Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem
An Alternate Formulation of the Symmetric Traveling Salesman Problem and Its Properties
On permutations of wires and states
Connectivity of k-extendable graphs with large k
Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths
Dense bipartite circulants and their routing via rectangular twisted torus
The second Zagreb indices of graphs with given degree sequences
Binary action games: Deviation properties, semi-strict equilibria and potentials
The period of the Fibonacci random number generator
Approximation algorithms for the fault-tolerant facility location problem with penalties
Permuting operations on strings and the distribution of their prime numbers
Additive edge labelings
A survey of the monotonicity and non-contradiction of consensus methods and supertree methods
Modulo k-orientations of random regular graphs
On the Equivalence of Two Tree Mapping Measures
Irreflexive and Reflexive Dimension
Hardness and approximation of the asynchronous border minimization problem
Are all pairs of hypomorphic digraphs S-isomorphic?
Algorithms for maximum social welfare of online random trading
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms
Linear time algorithms for NP-hard problems restricted to partial k-trees
Randomized vs. deterministic distance query strategies for point location on the line
Conflict-free connection number of random graphs
A smallest augmentation to 3-connect a graph
Perfect codes in 2-valent Cayley digraphs on abelian groups
The number of maximal matchings in polygon rings
The stochastic generalized bin packing problem
Computing discrete logarithms with the parallelized kangaroo method,
Comments on "A Hamilton sufficient condition for completely independent spanning tree"
Recognition of Gilmore-Gomory traveling salesman problem
Tolerance graphs
On pseudorandomness of families of binary sequences
On Cartesian products of signed graphs
Tangent circle graphs and 'orders'
Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring
Panconnectivity and edge-pancyclicity of multidimensional torus networks
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
On maximum graphs in Tutte polynomial posets
Secure total domination number in maximal outerplanar graphs
An algorithmic metatheorem for directed treewidth
Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation
A Method for Cutting Squares into Distinct Squares
Generalized cut method for computing the edge-Wiener index
An improvement of the Griesmer bound for some small minimum distances
On the enumeration of bipartite simple games
Pyramids and weak hierarchies in the ordinal model for clustering
Inferring strings from suffix trees and links on a binary alphabet
Variable and Term Removal From Boolean Formulae
Homogeneous and strictly homogeneous criteria for partial structures
Subgraphs, Closures and Hamiltonicity
Interactive unawareness in the graph model for multilateral conflicts
Minimizing the Weighted Number of Tardy Task Units
Super-simple (v, 5, 2)-designs
On approximating the d -girth of a graph
Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs
One-Pile Nim games with arbitrarily many random players
A note on worst-case performance of heuristics for maintenance scheduling problems
Properly colored paths and cycles
Rainbow connectivity and rainbow criticality on graph classes
The family constrained network problem
On graphs of defect at most 2
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm
Periodic gossiping on trees
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
Critical (P6, banner)-free graphs
Locally irregular edge-coloring of subcubic graphs
Graph Homomorphisms with Infinite Targets
The clique distribution in powers of hypercubes
The smallest normalized signless ∞ -Laplacian eigenvalue for non-bipartite graphs
On an Isoperimetric Problem for Hamming Graphs
Prefix and suffix reversals on strings
On the minimal ABC index of trees with k leaves
Erratum: Local Optimization on Graphs
Balanced compact clustering for efficient range queries in metric spaces
Base graph-connection graph: Dissection and construction
Efficient independent set approximation in unit disk graphs
On a base exchange game on bispanning graphs
Characterization of the allowed patterns of signed shifts
Properties of Euclidean minimum weight (k,ℓ)-tight graphs
Maximum patterns in datasets
On qualitatively independent partitions and related problems
Triangular line graphs and word sense disambiguation
Local Optima Topology for the k -Coloring Problem
An Algorithm for Fractional Assignment Problems
The restricted h-connectivity of the data center network DCell
Lattice valued relations and automata
Upper bounds for covering arrays by tabu search
Dichotomy for bounded degree H-colouring
Location routing problems on trees
Independent sets in extensions of 2 K 2 -free graphs
Reliability analysis of godan graphs
Sylvester power and weighted sums on the Frobenius set in arithmetic progression
Binary trees with the largest number of subtrees
On the number of non-dominated points of a multicriteria optimization problem
Open Shop Scheduling with Maximal Machines
Cryptanalysis of PRINCEv2 using Biclique structures
Minimal NMR distance information for rigidity of protein graphs
The maximum matching energy of bicyclic graphs with even girth
On single-machine scheduling without intermediate delays
Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees
Digraphs of bounded elimination width
Perfect Broadcasting in Unlabeled Networks
Cyclic Boolean circuits
The edge versus path incidence matrix of series-parallel graphs and greedy packing
Fractional dominations and fractional total dominations of graph complements
Generating functions for multi-labeled trees
Computing large planar regions in terrains, with an application to fracture surfaces
Nordhaus-Gaddum-type relations of three graph coloring parameters
Weakly quasi-Hamiltonian-set-connected multipartite tournaments
A Graph-theoretic Generalization of the Sauer-Shelah Lemma
Enumerating numerical sets associated to a numerical semigroup
Spanning 2-forests and resistance distance in 2-connected graphs
Extremal graphs for vertex-degree-based invariants with given degree sequences
P 3 -equicoverable graphs - Research on H-equicoverable graphs
Complexity of splits reconstruction for low-degree trees
Several parameters of generalized Mycielskians
Representation Theory and Invariant Neural Networks
Counting independent sets in a tolerance graph
A generic approach to proving NP-hardness of partition type problems
G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function
The parameters of subcodes of algebraic-geometric codes over prime subfields
Optimal pathway reconstruction on 3D NMR maps
Domination in distance-hereditary graphs
State transfers in vertex complemented coronas
Some Complexity Results about Threshold Graphs
Counting phylogenetic networks with few reticulation vertices: A second approach
The Weighted Perfect Domination Problem and Its Variants
Distance magic graphs G×C n
Computing solutions to the congruence 1n+2n+⋯+nn≡p(modn)
Makespan minimization for flow-shop problems with transportation times and a single robot
Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
Group theoretic properties of Rijndael-like ciphers
The non-positive circuit weight problem in parametric graphs: A solution based on dioid theory
Scheduling orders for multiple product types to minimize total weighted completion time
Stability in Discrete Tomography: some positive results
The co-secure domination in proper interval graphs
Almost empty monochromatic triangles in planar point sets
On-line maximum matching in complete multi-partite graphs with an application to optical networks
A type of generalized mesh-star transformation and applications in electrical networks
On the equitable total chromatic number of cubic graphs
Corrigendum to "Surmise relations between tests - mathematical considerations": [Discrete Applied Mathematics 127 (2003) 221-239]
Optimal normal bases in GF(p n )
On the approximability of some degree-constrained subgraph problems
Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
Vertex-symmetric Digraphs with Small Diameter
On the tractability of some natural packing, covering and partitioning problems