yusuke1997/dblp-id-title huggingface dataset:
Periodic Network Optimization with Different Arc Frequencies
The Wiener Number of the Hexagonal Net
On strongly Z 2s-1 -connected graphs
Characterising (k, l )-leaf powers
Bounds on the quality of reconstructed images in binary tomography
Scenario based robust line balancing: Computational complexity
Locking Based on a Pairwise Decomposition of the Transaction System
On the number of disjoint pairs of S-permutation matrices
Edge-coloring of 3-uniform hypergraphs
The algebraic representation of partial functions
Finding kings in tournaments
Two Machine open Shop Scheduling Problem with Bi-criteria
Injective edge coloring of graphs with maximum degree 5
On the hydra number of disconnected graphs
A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone
Probabilistic asymptotic properties of some combinatorial optimization problems
Job release scheduling problem: Complexity and an approximation algorithm
Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs
Isolation of connected graphs
Random coordination mechanism for scheduling games with machine modification
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Robust scheduling with budgeted uncertainty
Exploratory knowledge discovery over Web of Data
On chordal and perfect plane near-triangulations
Constructions of optimal GDRP(n, lambda;v)'s of type lambda 1 µ m-1
Interval incidence graph coloring
Maximal non-empty cross s -union families
Exploring the rigidity of planar configurations of points and rods
Global defensive k-alliances in graphs
The new FIFA rules are hard: complexity aspects of sports competitions
Orthogonal double covers of K n, n by small graphs
Approximating 2-cliques in unit disk graphs
Traffic-light scheduling on the grid
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
On the behavior of the N + -operator under blocker duality
On topology preservation of mixed operators in triangular, square, and hexagonal grids
A characterization of Thompson digraphs
A single-copy minimal-time simulation of a torus of automata by a ring of automata
Essential obstacles to Helly circular-arc graphs
A lower-bound for the number of productions required for a certain class of languages
A new time-discretization for delay multiple-input nonlinear systems using the Taylor method and first order hold
Full friendly index set - I
The edge fault-tolerance about the strong Menger edge-connectivity of order r among hamming graph
Vertex coloring acyclic digraphs and their corresponding hypergraphs
Deterministic algorithms for multi-criteria Max-TSP
Pseudo-Boolean optimization
A computational substantiation of the d-step approach to the number of distinct squares problem
Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint
Rank aggregation: New bounds for MCx
A note on the parameterized complexity of unordered maximum tree orientation
Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes
A binary search problem on graphs
Some recent results on Ramsey-type numbers
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
Key storage in secure networks
Permutation polynomials and their differential properties over residue class rings
A group testing problem for graphs with several defective edges
Asymptotics of the convex hull of spherically symmetric samples
A model for finding transition-minors
Two-segmented Channel Routing Is Strong NP-complete
Fast algorithms for finding a minimum repetition representation of strings and trees
Representation learning for temporal networks using temporal random walk and deep autoencoder
Some completion problems for graphs without chordless cycles of prescribed lengths
Global secure sets of grid-like graphs
An introduction to the perplex number system
Algorithms for Minclique Scheduling Problems
WEPA 2016 preface
Scheduling periodic events
Peakless Functions on Graphs
Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph
Atom-bond connectivity index of graphs
Dijkstra graphs
Algorithmic study on 2-transitivity of graphs
Generalised outerplanar Turán numbers and maximum number of k-vertex subtrees
Large (d, D, D', s) - bipartite Digraphs
Chain homotopies for object topological representations
Peter Ladislaw Hammer: December 23, 1936 to December 27, 2006
Tractability, hardness, and kernelization lower bound for and/or graph solution
Uniformly bounded duplication languages
Cluster editing with locally bounded modifications
Minimum k-path vertex cover
Near-linear-time algorithm for the geodetic Radon number of grids
2-extendability and k-resonance of non-bipartite Klein-bottle polyhexes
The channel capacity of read/write isolated memory
On clique numbers of colored mixed graphs
Randic ordering of chemical trees
On the construction of xor-magic graphs
Complexity of correspondence H-colourings
A tight axiomatization of the median procedure on median graphs
Coloring the square of a sparse graph G with almost Δ(G) colors
Complexity of minimizing the total flow time with interval data and minmax regret criterion
New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems
Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
Strong edge-coloring of cubic bipartite graphs: A counterexample
A note on finding a maximum empty rectangle
A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date"
Powers of cycles, powers of paths, and distance graphs
On the ratio of the domination number and the independent domination number in graphs
Concerning the complexity of deciding isomorphism of block designs
Template-driven rainbow coloring of proper interval graphs
End vertices in interval graphs
An analytical lower bound for a class of minimizing quadratic integer optimization problems
Labeling the r-path with a condition at distance two
Three Hoppy path problems and ternary paths
The Maker-Maker domination game in forests
Cooperative assignment games with the inverse Monge property
An optimal parallel connectivity algorithm
On the AVDTC of Sierpiński-type graphs
Clique-critical graphs: Maximum size and recognition
On linear algebra of balance-binomial graphs
Classifying negative and positive points by optimal box clustering
Resonance graphs of plane bipartite graphs as daisy cubes
Geometry of gross substitutes valuations
On a new type of distance Fibonacci numbers
Applications of algebra to cryptography
Generalized local branching heuristics and the capacitated ring tree problem
3-color Schur numbers
L(p, q)-labeling of digraphs
Graph-FCA: An extension of formal concept analysis to knowledge graphs
Unreliable point facility location problems on networks
Regular affine tilings and regular maps on a flat torus
Rainbow domination on trees
A primal-dual approximation algorithm for Minsat
Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs
Some bounds on global alliances in trees
On computing the Galois lattice of bipartite distance hereditary graphs
Permutation polynomials and a new public-key encryption
How to Find a Point on a Line Within a Fixed Distance
List-coloring graphs without K 4, k -minors
[1, 2]-sets and [1, 2]-total sets in trees with algorithms
An improved bound for the stepping-up lemma
Equivalence-free exhaustive generation of matroid representations
Nowhere-zero flow on some products of signed graphs
Proving a conjecture on prime double square tiles
Delay-related secondary objectives for rectilinear Steiner minimum trees
Ordering trees by their distance spectral radii
Consensus algorithms for the generation of all maximal bicliques
Probabilistic single processor scheduling
Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63]
Q-Factorization of suffixes of two-way infinite extensions of irrational characteristic words
Tree decompositions with small cost
Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II
Covering the Complete Graph with Plane Cycles
Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations
Noncrossing Hamiltonian paths in geometric graphs
Occurrence of structured motifs in random sequences: Arbitrary number of boxes
Maintaining balanced trees for structured distributed streaming systems
A bounded-risk mechanism for the kidney exchange game
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
Solitaire Clobber played on Cartesian product of graphs
Trees with large neighborhood total domination number
Perfect Italian domination on planar and regular graphs
Path Covering Problems and Testing of Printed Circuits
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
On constructing rational spanning tree edge densities
Steiner trees and polyhedra
Intersection graph of maximal stars
Connectivity and fault-tolerance of hyperdigraphs
Quantum fractional revival on graphs
Partition line graphs of multigraphs into two subgraphs with large chromatic numbers
Convex drawings of graphs with non-convex boundary constraints
On uniform k -partition problems
On the matching and permanental polynomials of graphs
Rooted tree statistics from Matula numbers
A better step-off algorithm for the knapsack problem
On mean distance and girth
On a class of m-to-1 functions
On the Complexity of Inferring Functional Dependencies
Observations on a class of nasty linear complementarity problems
Cellular telephone networks and random maps in hypergraphs
Counting the number of non-equivalent vertex colorings of a graph
On the number of words containing the factor (aba) k
An odd kind of BCH code
Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern
Firefighting on the hexagonal grid
Heuristics for the Steiner Problem in Graphs
On forwarding indices of networks
A single shuffle is enough for secure card-based computation of any Boolean circuit
Complete subgraphs in connected graphs and its application to spectral moment
Generalization of aTheorem on the Parametric Maximum Flow Problem
Enumeration of polyominoes inscribed in a rectangle
Node-searching problem on block graphs
Complexity of (p, 1)-total labelling
Exploring the complexity of the integer image problem in the max-algebra
Coverings of planar and three-dimensional sets with subsets of smaller diameter
The smallest values of algebraic connectivity for unicyclic graphs
Combinatorial dynamical system theory: General framework and controllability criteria
Approximation results for a min-max location-routing problem
Packing Krs in bounded degree graphs
Improved book-embeddings of incomplete hypercubes
A note on visibility-constrained Voronoi diagrams
On the λ-robustness of matrices over fuzzy algebra
On a conjecture of Eǧecioǧlu and Iršič
Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
Geodetic convexity parameters for (q, q-4)-graphs
Strongly rigid tensegrity graphs on the line
Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors
A covering problem that is easy for trees but I -complete for trivalent graphs
Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem
Coronoid Systems with Perfect Matchings
Tree spanners in planar graphs
Testability of minimum balanced multiway cut densities
Analysis of a generalized Linear Ordering Problem via integer programming
Recognition and Isomorphism of Tree-like P 4 -connected Graphs
Labeling bipartite permutation graphs with a condition at distance two
Connectivity, Persistence and Fault Diagnosis of Interconnection Networks Based on O k and 2 O k Graphs
Cluster structures and collections of Galois closed entity subsets
The Complexity of Recognizing Tough Cubic Graphs
Equilibrium paths in discounted supergames
k-planar crossing number of random graphs and random regular graphs
The 3-path-connectivity of the star graphs
Minimal Connected Enclosures on an Embedded Planar Graph
On the minimum vertex cover of generalized Petersen graphs
Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
Hard problems in similarity searching
Discrete facility location and routing of obnoxious activities
Acyclic colouring of 1-planar graphs
Dynamic coloring of graphs having no K 5 minor
Regularity of Splicing Languages
Time offset optimization in digital broadcasting
On the eccentric connectivity index of uniform hypergraphs
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
Harmonious chromatic number of directed graphs
Properties of positive functions and the dynamics of associated automata networks
A note on the lower bound of centralized radio broadcasting for planar reachability graphs
A concise characterization of strong knapsack facets
Coloring some classes of mixed graphs
First order sentences about random graphs: Small number of alternations
Boomerang uniformity of some classes of functions over finite fields
More results on the z-chromatic number of graphs
Watching systems in graphs: An extension of identifying codes
On the minimal eccentric connectivity indices of bipartite graphs with some given parameters
A linear algorithm for the domination number of a series-parallel graph
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem
The Characterization of Branching Dependencies
NP-completeness of edge-colouring some restricted graphs
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem
Axiomatic characterization of the center function. The case of universal axioms
Shortest paths with a cost constraint: A probabilistic analysis
The least Euclidean distortion constant of a distance-regular graph
Domination graphs: examples and counterexamples
Two metrics in a graph theory modeling of organic chemistry
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights
Some Large Trivalent Graphs Having Small Diameters
Counting and enumerating galled networks
Approximation algorithm for (connected) Italian dominating function
NP-completeness of some problems of partitioning and covering in graphs
Opinion forming in Erdős-Rényi random graph and expanders
A vector exchange property of submodular systems
Recursive bounds for perfect hashing
Lower and upper bounds for the Bin Packing Problem with Fragile Objects
On the monophonic convexity in complementary prisms
Maxima of the Q-index for 3K3-free graphs
Top to random shuffles on colored permutations
The structural properties of { ( 2 , 3 ) , 6 } - spheres
On star-critical and upper size Ramsey numbers
Infinite chromatic games
The vertex PI index and Szeged index of bridge graphs
On the complexity of some subgraph problems
A simple algorithm for multicuts in planar graphs with outer terminals
Constructing error-correcting binary codes using transitive permutation groups
A note on gray code and odd-even merge
On minimizing the maximum color for the 1-2-3 Conjecture
The median function of a block graph: Axiomatic characterizations
On strongly asymmetric and controllable primitive graphs
On Bayer's deformation and the associativity formula
Dualization of regular Boolean functions
Positive and Horn Decomposability of Partially Defined Boolean Functions
Paired-domination game played on cycles
Factorisations courtes dans un groupe fini
Feedback edge sets in temporal graphs
Recursive merge sort with erroneous comparisons
on the Complexity of Recognizing a Class of Perfectly orderable Graphs
Monotone concepts for formal concept analysis
Threshold properties of random boolean constraint satisfaction problems
The competition numbers of complete tripartite graphs
Approximating minimum-power edge-covers and 2, 3-connectivity
A generalization of Lucas polynomial sequence
A concentration bound for the longest increasing subsequence of a randomly chosen involution
A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
A robber locating strategy for trees
A de Bruijn-Erdös Theorem for (q, q-4)-graphs
A sufficient condition for P k -path graphs being r-connected
An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
Characterization of forbidden subgraphs for the existence of even factors in a graph
Degree distance of unicyclic and bicyclic graphs
Recognizing sign solvable graphs
A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Tight Approximations for Resource Constrained Scheduling and Bin Packing
2k 2 -partition of some classes of graphs
On improving matchings in trees, via bounded-length augmentations
Maximum packing for biconnected outerplanar graphs
Labeled Versus Unlabeled Distributed Cayley Networks
How Do I Marry Thee? Let Me Count the Ways!
Cyclic base ordering of certain degenerate graphs
On the potential function σ(H,m,n) of an arbitrary bipartite graph H
Structural insights about avoiding transfers in the patient-to-room assignment problem
The d-blocker number and d-transversal number of hexagonal systems
On Sum Coloring of Graphs
Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
Transistor Chaining in Static CMOS Functional Cells of Arbitrary Planar Topology
Toughness properties of arbitrarily partitionable graphs
A graph discretization of vector Laplacian
Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
Preference modeling on totally ordered sets by the Sugeno integral
Subgraphs decomposable into two trees and k-edge-connected subgraphs
On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions
A note on stability results for Berge-Ks,t hypergraphs
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs
Necessary conditions for the existence of two classes of ZCPS-Wh(v)
The maximum number of winning 2-sets
Solving discrete logarithm problems faster with the aid of pre-computation
The palindromization map
Total restrained domination in claw-free graphs with minimum degree at least two
The competition number of the complement of a cycle
The secure domination number of Cartesian products of small graphs with paths and cycles
Bounds on the PI index of unicyclic and bicyclic graphs with given girth
The inverse protein folding problem on 2D and 3D lattices
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
Arc-disjoint in- and out-branchings in semicomplete split digraphs
On graphs determining links with maximal number of components via medial construction
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
Independent spanning trees with small depths in iterated line digraphs
Nonempty intersection of longest paths in graphs without forbidden pairs
On the semitotal domination number of line graphs
On two problems related to anti-adjacency (eccentricity) matrix
Comparison between the Szeged index and the eccentric connectivity index
Minimal separators in extended P 4 -laden graphs
On the signless Laplacian Estrada index of bicyclic graphs
Normalized Laplacian spectrum of complete multipartite graphs
Counting maximal independent sets in some n-gonal cacti
Wiener indices of balanced binary trees
A comparison of Steiner tree relaxations
Anti-Ramsey properties for tight cycles of random hypergraphs
Graph problems and monotone classes
Pure-strategy Nash equilibria on competitive diffusion games
Claw-free minimal matching covered graphs
Reliable broadcasting
Solution to a problem of Katona on counting cliques of weighted graphs
PageRank optimization by edge selection
A fast approximation algorithm for the multicovering problem
The relationship between the eccentric connectivity index and Zagreb indices
Generalized knight's tour on 3D chessboards
Convex recoloring of paths
Euclidean farthest-point Voronoi diagram of a digital edge
The mixed postman problem
Sweeping an oval to a vanishing point
Lower and upper orientable strong radius and strong diameter of complete k-partite graphs
A parallelogram tile fills the plane by translation in at most two distinct ways
The structure of minimally t-tough, 2K2-free graphs
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
Analysis of 3gpp-MAC and Two-key 3gpp-MAC
Bumblebee visitation problem
Cutting planes in integer and mixed integer programming
Solving satisfiability in less than 2 n steps
Acute triangulations of convex quadrilaterals
The generalized 4-connectivity of hierarchical cubic networks
Cycle isolation in graphs
On the asymptotic behaviour of Lee-codes
Planar graphs without chordal 6-cycles are 4-choosable
Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time
General sum-connectivity index of unicyclic graphs with given diameter
Computing simple paths from given points inside a polygon
The elimination procedure for the competition number is not optimal
Random backtracking in backtrack search algorithms for satisfiability
On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
on Preemptive Scheduling: A General Setting for the Two-phase Method
Maximum atom-bond connectivity index with given graph parameters
NP-Completeness of Minimum Spanner Problems
The zoo of tree spanner problems
Further results on the eccentric distance sum
Efficient Reformulation for 0-1 Programs - Methods and Computational Results
Well-hued graphs
A measure for a balanced workload and its extremal values
Orientations of digraphs almost preserving diameter
On oriented diameter of (n,k)-star graphs
The Connectivity of Hierarchical Cayley Digraphs
on the Problem of Sorting Burnt Pancakes
Incidence Graphs of Biacyclic Hypergraphs
On difference of Zagreb indices
On the dominating (induced) cycles of iterated line graphs
Some Extremal Properties of the Degree Distance of a Graph
Metric and ultrametric inequalities for directed graphs
Simple tree pattern matching for trees in the prefix bar notation
Phylogeny Numbers
Existence of whist tournaments with the three-person property 3PWh(v)
Erratum to "Comparison of column generation models for channel assignment in cellular networks"
Hosoya polynomials under gated amalgamations
On bounding the difference between the maximum degree and the chromatic number by a constant
An extremal problem for total domination stable graphs upon edge removal
Distances Between Traveling Salesman Tours
Solving the tree containment problem in linear time for nearly stable phylogenetic networks
Laced Boolean functions and subset sum problems in finite fields
On the excessive [m]-index of a tree
Descent generating polynomials for (n-3)- and (n-4)-stack-sortable (pattern-avoiding) permutations
A tight lower bound on non-adaptive group testing estimation
A random model of publication activity
A linear algorithm for finding a minimum dominating set in a cactus
On the acyclic disconnection and the girth
Orthogonal covers by multiplication graphs
Communication in m-connected graphs
An efficient RSA-based certificateless public key encryption scheme
Upper bounds for the inverse sum indeg index of graphs
Quasi-median hulls in Hamming space are Steiner hulls
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy
Independence polynomials of some compound graphs
The rainbow numbers of cycles in maximal bipartite planar graph
Interval edge-colorings of composition of graphs
The change of Seidel energy of 5-partite Turán graph due to edge deletion
Sampling properties of the discrete radon transform
An algebraic approach to lifts of digraphs
The VC-dimension of Set Systems Defined by Graphs
About equivalent interval colorings of weighted graphs