yusuke1997/dblp-id-title huggingface dataset:
Asymptotic Estimation of the Average Number of Terminal States in DAWGs
Which k-trees are cover-incomparability graphs?
On the intersection of all critical sets of a unicyclic graph
Binary templates for comma-free DNA codes
Edge disjoint caterpillar realizations
Positive semidefiniteness of Aα(G) on some families of graphs
The complexity of short two-person games
The thickness of a graph with constraint on girth
Total domination dot-critical graphs
Geodesic-pancyclic graphs
A note on 2-bisections of claw-free cubic graphs
Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems
Link key candidate extraction with relational concept analysis
Graph Transformations Which Preserve the Multiplicity of an Eigenvalue
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
Characterization and recognition of some opposition and coalition graph classes
A Tight Upper Bound for Group Testing in Graphs
The edge-disjoint paths problem is NP-complete for series-parallel graphs
Full orientability of graphs with at most one dependent arc
Neighborhood-restricted [≤2]-achromatic colorings
Uniform emulations of Cartesian-product and Cayley graphs
Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
Complexity of two coloring problems in cubic planar bipartite mixed graphs
Intertwined Infinite Binary Words
Shapley-Folkman-type theorem for integrally convex sets
On the Kirchhoff index of graphs with diameter 2
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
On bicliques and the second clique graph of suspensions
Negative circuits for flows and submodular flows
A note on secure domination in C5-free graphs
Symmetric unique neighbor expanders and good LDPC codes
Guarding rectangular art galleries
On the oriented achromatic number of graphs
Observable graphs
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
Largest domination number and smallest independence number of forests with given degree sequence
On the quadratic assignment problem
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
The Kirchhoff index of subdivisions of graphs
RCA-Seq: An original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns
Elusiveness of finding degrees
Weak sense of direction labelings and graph embeddings
Waiting times for clumps of patterns and for structured motifs in random sequences
Heyting algebras with Boolean operators for rough sets and information retrieval applications
Complexity aspects of ℓ-chord convexities
Polymatroidal flows with lower bounds
A sufficient condition for boundedness of tolerance graphs
Fractional matching preclusion numbers of Cartesian product graphs
A lower bound for radio k-chromatic number
Variable neighborhood search for the degree-constrained minimum spanning tree problem
A new Euler-Mahonian constructive bijection
More Broadcast Graphs
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
Minimum decomposition into convex binary matrices
Degenerate drawing of outerplanar graphs with two edge lengths
On total chromatic number of complete multipartite graphs
A note on total reinforcement in graphs
Complexity of the path avoiding forbidden pairs problem revisited
A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs
Weighted efficient domination in two subclasses of P 6 -free graphs
Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results
On the skew-permanental polynomials of orientation graphs
The complexity of AND - decomposition of Boolean functions
An introduction to randomized algorithms
Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs
Relations between global forcing number and maximum anti-forcing number of a graph
Equi-assignments and explicit solutions of a particular discrete optimization problem
On Trees and Noncrossing Partitions
A sufficient condition for a planar graph to be (F, F2)-partitionable
A set-covering based heuristic algorithm for the periodic vehicle routing problem
On the super domination number of lexicographic product graphs
Acyclic Molecules with Greatest HOMO-LUMO Separation
Learning random monotone DNF
Open-end bin packing: New and old analysis approaches
On the Deterministic Complexity of Searching Local Maxima
Consistency of the QNet algorithm for generating planar split networks from weighted quartets
on a Scheduling Problem in a Robotized Analytical System
Counting graceful labelings of trees: A theoretical and empirical study
Preface: CALDAM 2015
Hamiltonian threshold graphs
On the Wiener index of generalized Fibonacci cubes and Lucas cubes
Improving heuristics for network modularity maximization using an exact algorithm
Restricting SBH ambiguity via restriction enzymes
On color-critical (P 5 , co-P 5 )-free graphs
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
Whist tournaments with the three person property
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
Direct merging of delta encoded files
Some Problems on Factorizations with Constraints in Bipartite Graphs
Language-theoretic Complexity of Disjunctive Sequences
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979]
A proof for a conjecture of Gorgol
On constant composition codes
Obstructions for linear rank-width at most 1
Domination and convexity problems in the target set selection model
Coset Correlation of LR m-Arrays
Patience of matrix games
Comparison of mean hitting times for a degree-biased random walk
on the K-coloring of Intervals
Maximizing edge-ratio is NP-complete
A counterexample to a conjecture on facial unique-maximal colorings
Generalized Degrees and Menger Path Systems
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices
Optimization and reconstruction of hv -convex (0, 1)-matrices
Optimal clustering of multipartite graphs
Asymmetric colorings of products of graphs and digraphs
A Proof of Jean De Rumeur's Conjecture
Solving problems for maximal reducible flowgraphs
Kinetic maintenance of mobile k-centres on trees
Averaging 2-rainbow domination and Roman domination
The Complexity of Lifted Inequalities for the Knapsack Problem
On a Problem Concerning Tolerance Graphs
On a conjecture on the order of cages with a given girth pair
Set to Set Broadcasting in Communication Networks
Cycle Structure of Edge Labelled Graphs
Optimal identifying codes of two families of Cayley graphs
On the relation between Maximin h stability and Generalized Metarationality in bilateral conflicts
Equistable graphs, general partition graphs, triangle graphs, and graph products
The fast search number of a Cartesian product of graphs
Edge-disjoint Hamilton cycles in the McKay-Miller-Širáň graphs
Normal Helly circular-arc graphs and its subclasses
2-extendability of toroidal polyhexes and Klein-bottle polyhexes
Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices
Weighted Parameters in (P5, P5)-free Graphs
A duality theorem for linear congruences
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem
On the connectivity of close to regular multipartite tournaments
Structural aspects of the Student Project Allocation problem
Subgroups as efficient dominating sets in Cayley graphs
Toward optimal gossiping schemes with conference calls
Messy broadcasting - Decentralized broadcast schemes with limited knowledge
A note on "parallel machine scheduling with non-simultaneous machine available time"
The bottleneck 2-connected k-Steiner network problem for k≤2
Synthesizing cubes to satisfy a given intersection pattern
The complexity of nonrepetitive coloring
Quasi-kernels in split graphs
Crossing minimization in extended level drawings of graphs
Graphs that are simultaneously efficient open domination and efficient closed domination graphs
Upper bounds of r-hued colorings of planar graphs
Adjoining to (K, s, t)-Wythoff's game its P-generators as moves
Perfect edge domination and efficient edge domination in graphs
Sorting by Bounded Block-moves
On basic forbidden patterns of functions
Non-overlapping descents and ascents in stack-sortable permutations
Transverse rigidity is prestress stability
A 3D 6-subiteration curve thinning algorithm based on P -simple points
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
Strengthening Brooks' chromatic bound on P6-free graphs
Disjoint cycles in graphs with restricted independence number
Low complexity bit-parallel multiplier for F2n defined by repeated polynomials
Exact enumeration of acyclic deterministic automata
r-dynamic colorings and the spectral radius in graphs
Resolution Search
The unambiguity of segmented morphisms
Characterizations of some classes of strong sign nonsingular digraphs
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
On split graphs with four distinct eigenvalues
On Hamiltonicity of regular graphs with bounded second neighborhoods
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time
Space graphs and sphericity
Subset-sum problems with different summands: computation
Orbits of Boolean Functions
Kernels by rainbow paths in arc-colored tournaments
Binary linear programming solutions and non-approximability for control problems in voting systems
Conflict-directed A * and its role in model-based embedded systems
Practical algorithms for branch-decompositions of planar graphs
On the maximum diversity of hypergraphs with fixed matching number
On triangulating k-outerplanar graphs
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
Exact evaluation of targeted stochastic watershed cuts
h-restricted connectivity of locally twisted cubes
On the complexity of paths avoiding forbidden pairs
Spectral conditions for component factors in graphs involving minimum degree
Partitioning vertices into in- and out-dominating sets in digraphs
Minimum edge ranking spanning trees of split graphs
Community detection in networks via a spectral heuristic based on the clustering coefficient
On the competition graphs of d-partial orders
Online algorithms for a dual version of bin packing
Sports scheduling search space connectivity: A riffle shuffle driven approach
Monotone bargaining is Nash-solvable
Regular-SAT: A many-valued approach to solving combinatorial problems
Augmenting trees so that every three vertices lie on a cycle
Enumeration of inversion sequences avoiding triples of relations
A Note on Perfectly orderable Graphs
The shortest connection game
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
k-restricted edge-connectivity in triangle-free graphs
[1,2]-dimension of graphs
New results on ptolemaic graphs
On the in-out-proper orientations of graphs
Competition hypergraphs
Maximum sizes of graphs with given restrained domination numbers
Various characterizations of throttling numbers
Some results related to the tenacity and existence of k-trees
Equistable simplicial, very well-covered, and line graphs
Super restricted edge-connectivity of graphs with diameter 2
On the regularization of a cooperative solution in a multistage game with random time horizon
Ordinal sums of impartial games
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs
2-coupon coloring of cubic graphs containing 3-cycle or 4-cycle
Total tessellation cover: Bounds, hardness, and applications
Latin squares with bounded size of row prefix intersections
New ( Delta, D ) Graphs Discovered by Heuristic Search
Correlation in Partially Ordered Sets
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
The proper 2-connection number of several graph classes
A branch-and-cut algorithm for the routing and spectrum allocation problem
NIC-planar graphs
Line segment disk cover
Resilience and optimization of identifiable bipartite graphs
Computing Optimal Assignments for Residual Network Reliability
On the continuous working problem
Bandwidth and distortion revisited
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures
Low density series expansions for backbone properties of percolation clusters
Stable partitions with W -preferences
A linear-time algorithm for semitotal domination in strongly chordal graphs
Improving the extraction and expansion method for large graph coloring
On the removal of forbidden graphs by edge-deletion or by edge-contraction
Preface: Algorithmic Graph Theory on the Adriatic Coast
Higher order matching preclusion for regular interconnection networks
Modular decomposition of graphs and the distance preserving property
A tight upper bound for 2-rainbow domination in generalized Petersen graphs
Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring
Linear Recognition of Pseudo-split Graphs
The quadratic knapsack problem - a survey
A theory of decomposition into prime factors of layered interconnection networks
Computational complexity of distance edge labeling
3-symmetric and 3-decomposable geometric drawings of K n
Matching preclusion and conditional matching preclusion for regular interconnection networks
Degree sequence optimization and extremal degree enumerators
A note on the minimum inverse sum indeg index of cacti
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
Special structures in Q(4,q), projective planes and its application in L(h,k)-colorings of their Moore Graphs
Edge intersection graphs of L-shaped paths in grids
A 34-approximation of Vizing's conjecture for claw-free graphs
On the secure domination numbers of maximal outerplanar graphs
Counting independent sets in tricyclic graphs
New upper and lower bounds on the channel capacity of read/write isolated memory
A new characterization of P 6 -free graphs
Broadcasting Multiple Messages in Simultaneous Send/receive Systems
On finite pseudorandom binary lattices
Unit and single point interval graphs
On hamiltonian colorings for some graphs
General upper bounds on independent k-rainbow domination
Parallel cleaning of a network with brushes
The strongly regular twisted D5,5(q) graph
Neighbor connectivity of hypercube-based compound network
On the pagenumber of trivalent Cayley graphs
An approximation algorithm for maximum triangle packing
An interconnection of local maps inducing onto global maps
Consecutive edge-coloring of the generalized theta-graph
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
An algebraic algorithm for solving parametric integer programs
On well-covered triangulations: Part II
Closest 4-leaf power is fixed-parameter tractable
Around the Complete Intersection Theorem
On enumerating all minimal solutions of feedback problems
Online binary minimax trees
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Determining the automorphism group of the linear ordering polytope
Information dissemination and confusion in signed networks
Adaptive majority problems for restricted query graphs and for weighted sets
A note on the hardness of Skolem-type sequences
Chordally signed graphs
On the complexity of a family of generalized matching problems
Fine-grained parameterized complexity analysis of graph coloring problems
Generalized self-approaching curves
Minimum average distance of strong orientations of graphs
Some results on the ordering of the Laplacian spectral radii of unicyclic graphs
On the use of augmenting chains in chain packings
On the structure and the number of prime implicants of 2-s
k-tuple colorings of the Cartesian product of graphs
An evolutionary algorithm for discrete tomography
Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model
Polyhedral structure of submodular and posi-modular systems
Fast approximation algorithm for job sequencing with deadlines
On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes
On k-partitioning of Hamming Graphs
Some comparative results concerning the Grundy and b-chromatic number of graphs
Strong chromatic index of K1, t-free graphs
Niche graphs
On the consistency of the minimum evolution principle of phylogenetic inference
New inequalities for network distance measures by using graph spectra
On the computational complexity of a merge recognition problem
Linear relations for p-harmonic functions
A Lower Bound for the Shortness Coefficient of a Class of Graphs
VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters, n States
Minmax regret for sink location on dynamic flow paths with general capacities
On the complexity of constrained VC-classes
Colorings with neighborhood parity condition
The point-to-point delivery and connection problems: complexity and algorithms
A note on rectilinear and polar visibility graphs
The many benefits of putting stack filters into disjunctive or conjunctive normal form
Commuting Eulerian operators
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem
On the complexity of finding the convex hull of a set of points
A Note on Graphs Which Have Upper Irredundance Equal to Independence
On the shape of permutomino tiles
Bounds on the Size of Merging Networks
Threshold phenomena in random structures
The number of switching isomorphism classes of signed graphs associated with particular graphs
Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP)
The box-TDI system associated with 2-edge connected spanning subgraphs
Flexible allocation on related machines with assignment restrictions
Vertex-minors of graphs: A survey
The Allocation Problem in Hardware Design
Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
Characterizing graphs of small carving-width
Labeling algorithms for domination problems in sun-free chordal graphs
Local protein threading by Mixed Integer Programming
A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines
Transitive reduction of a rectangular boolean matrix
On an inequality between pseudorandom measures of lattices
Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures
Optimal Binary Trees with Order Constraints
On Edge Numberings of the n -Cube Graph
On tree-wheel Ramsey numbers
Linear-Time Separation Algorithms for the Three-Index Assignment Polytope
Algorithmic aspects of open neighborhood location-domination in graphs
on the Computation of Pfaffians
On bipartite graphs with minimal energy
A Cost-scaling Algorithm for 0-1 Submodular Flows
On the approximability of the minimum strictly fundamental cycle basis problem
Constructive complexity
on Some Multicriteria Arborescence Problems: Complexity and Algorithms
The continuous center set of a network
Reversible complement cyclic codes over Galois rings with application to DNA codes
Compact scheduling of zero-one time operations in multi-stage systems
General cut-generating procedures for the stable set polytope
Some Results on Greedy Algorithm Conjectures
Broadcast time and connectivity
Enumeration of spanning trees and resistance distances of generalized blow-up graphs
Thinness of product graphs
Webster sequences, apportionment problems, and just-in-time sequencing
On a class of completable partial edge-colourings
A polyhedral characterization of linearizable quadratic combinatorial optimization problems
Symmetric matrices and codes correcting rank errors beyond the [( d -1)/2] bound
Regeneration in IL systems
Vehicle routing with split deliveries
Detection and recognition of a binary linear code
Partial Dependencies in Relational Databases and their Realization
Thinning on cell complexes from polygonal tilings
An Efficient Algorithm for the Knight's Tour Problem
Finding all essential terms of a characteristic maxpolynomial
Optimal (r, ≤3)-locating-dominating codes in the infinite king grid
Measures on monotone properties of graphs
Fullerenes with complete Clar structure
Randic Structure of a Graph
Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults
A decision procedure on partially commutative free monoids
On a relation between the atom-bond connectivity and the first geometric-arithmetic indices
Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS)
Bounding the number of k-faces in arrangements of hyperplanes
The greatest values for atom-bond sum-connectivity index of graphs with given parameters
Computing the conductor of an integral extension
Trees with maximum p-reinforcement number
On nonsystematic perfect binary codes of length 15
Polynomial-time approximation algorithms for weighted LCS problem
Approximation algorithms for the weighted independent set problem in sparse graphs
Further cryptographic properties of the multiplicative inverse function
Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs
Parametric shortest path algorithms with an application to cyclic staffing
2-distance coloring of planar graphs without 4, 6-cycles
Nonexistence of a few binary orthogonal arrays
Can the catenation of two weakly sparse languages be dense?
Comparing bacterial genomes from linear orders of patterns
The average reliability of a graph
Strong unimodularity for matrices and hypergraphs
Edge Deletion Preserving the Diameter of the Hypercube
The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
On the max min vertex cover problem
Facet-inducing web and antiweb inequalities for the graph coloring polytope
Strong edge-colouring of sparse planar graphs
Gap one bounds for the equitable chromatic number of block graphs
Finding densest k-connected subgraphs
On sheffer symmetric functions in three-valued logic
An (F3,F4)-partition of planar graphs without 4- and 6-cycles
Efficient line broadcasting in a d-dimensional grid
On the b-coloring of P 4 -tidy graphs
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program
NP-completeness of generalized multi-Skolem sequences
Extremal Kirchhoff index in polycyclic chains
Super-simple (v, 5, 4) designs
The degree resistance distance of cacti
Odd-sum colorings of planar graphs
On the eccentric connectivity index of k-uniform hyper-cacti
Identities via Bell matrix and Fibonacci matrix
Strong resolving partitions for strong product graphs and Cartesian product graphs
The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences
Faster Isometric Embedding in Products of Complete Graphs
The zero forcing polynomial of a graph
A clique-difference encoding scheme for labelled k-path graphs
Enumeration of inequivalent irreducible Goppa codes
Broadcasting in random graphs
Extremal problems for trees with given segment sequence
The list r-hued coloring of Km,n
Using local similarity measures to efficiently address approximate graph matching
Complexity of the directed spanning cactus problem
An inductive definition of cubic toroidal maps