the proceedings contain 38 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: Determining Number of Generalized and Double Generalized Petersen Graph;se...
ISBN:
(纸本)9783030392185
the proceedings contain 38 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: Determining Number of Generalized and Double Generalized Petersen Graph;self-centeredness of Generalized Petersen Graphs;weak Roman Bondage Number of a Graph;on the Geodetic and Hull Numbers of Shadow Graphs;indicated Coloring of Complete Expansion and Lexicographic Product of Graphs;smallest C2l+1-Critical Graphs of Odd-Girth 2k+1;ramsey Numbers for Line Graphs;Δ-Convexity Number and Δ-Number of Graphs and Graph Products;on Cartesian Products of Signed Graphs;partitioning Cographs into Two Forests and One Independent Set;list Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph;on Algebraic Expressions of Two-Terminal Directed Acyclic Graphs;the Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10;on the Minimum Satisfiability Problem;waiting for Trains: Complexity Results;oriented Diameter of Star Graphs;gathering over Meeting Nodes in Infinite Grid;0-1 Timed Matching in Bipartite Temporal Graphs;arbitrary Pattern Formation by Opaque Fat Robots with Lights;greedy Universal Cycle Constructions for Weak Orders;monitoring the Edges of a Graph Using Distances;a New Model in Firefighting theory;an Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties;overlaying a Hypergraph with a Graph with Bounded Maximum Degree;parameterized algorithms for Directed Modular Width;on the Parameterized Complexity of Spanning Trees with Small Vertex Covers;minimum Conflict Free Colouring Parameterized by Treewidth;planar Projections of Graphs;new algorithms and Bounds for Halving Pseudolines;algorithms for Radon Partitions with Tolerance.
the proceedings contain 30 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: Parameterized Complexity of Coupon Coloring of Graphs;spectra of...
ISBN:
(纸本)9783031834370
the proceedings contain 30 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: Parameterized Complexity of Coupon Coloring of Graphs;spectra of Eccentricity Matrices of Product of Graphs;almost Empty Monochromatic Polygons in Planar Point Sets;on the Parameterized Complexity of Odd Coloring;on Full-Separating Sets in Graphs;polynomial Time algorithms for Hop Domination;charging Station Placement for Limited Energy Robots;multipacking in the Euclidean Metric Space;partial Domination in Some Geometric Intersection Graphs;generalized Lettericity of Graphs;polynomial-Time algorithms for Path Cover on Trees and Graphs of Bounded Treewidth;Fast FPT algorithms for Grundy Number on Dense Graphs;on a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis;algorithms and Hardness Results for the (3, 1)-Cover Problem;extension Perfect Roman Domination;a Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks;two Step Graph Protection Game;bipartite Domination in Graphs: Complexity and algorithms;packing Sets of Paths, Stars and Triangles: Tractability and Approximability;structural Parameterization of Minus Domination;an Algebraic Characterization of Strong Graphs;there are Finitely Many Uniformly Most Reliable Graphs of Corank 5;helly Number, Radon Number and Rank in Δ-Convexity on Graphs;forbidden Induced Subgraphs in Iterative Higher Order Line Graphs;total Domination and Open Packing in Two Subclasses of Triangle-Free Graphs;the MASEMPR Problem and Its Applications in Logistics;Broadcast Graph is NP-Complete;maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs.
the proceedings contain 22 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: On Total Chromatic Number of Complete Multipartite Graphs;parameteriz...
ISBN:
(纸本)9783031522123
the proceedings contain 22 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: On Total Chromatic Number of Complete Multipartite Graphs;parameterized Aspects of Distinct Kemeny Rank Aggregation;on Query Complexity Measures and their Relations for Symmetric Functions;improved algorithms for Minimum-Membership Geometric Set Cover;semi-total Domination in Unit Disk Graphs;geometric Covering Number: Covering Points with Curves;growth Rate of the Number of Empty Triangles in the Plane;distance-2-Dispersion with Termination by a Strong Team;monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity;total Coloring of Some Graph Operations;impact of Diameter and Convex Ordering for Hamiltonicity and Domination;eternal Connected Vertex Cover Problem in Graphs: Complexity and algorithms;unique Least Common Ancestors and Clusters in Directed Acyclic Graphs;open Packing in H-free Graphs and Subclasses of Split Graphs;the Frobenius Problem for the Proth Numbers;preface;star Colouring of Regular Graphs Meets Weaving and Line Graphs;the Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability;location-Domination Type Problems Under the Mycielski Construction;star Covers and Star Partitions of Cographs and Butterfly-free Graphs.
the proceedings contain 34 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: On Locally Identifying Coloring of Graphs;on Structural Parameterizat...
ISBN:
(纸本)9783031252105
the proceedings contain 34 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: On Locally Identifying Coloring of Graphs;on Structural Parameterizations of Star Coloring;perfectness of G-generalized Join of Graphs;on Coupon Coloring of Cayley Graphs;coloring of a Superclass of 2 K2 -free graphs;the Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures;short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs;some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs;monitoring Edge-Geodetic Sets in Graphs;optimal Length Cutting Plane Refutations of Integer Programs;cyclability, Connectivity and Circumference;on three Domination-Based Identification Problems in Block Graphs;computational Aspects of Double Dominating Sequences in Graphs;relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs;cops and Robber on Oriented Graphs with Respect to Push Operation;mind the Gap: Edge Facility Location Problems in theory and Practice;complexity Results on Cosecure Domination in Graphs;latin Hexahedra and Related Combinatorial Structures;algorithms and Complexity of Strongly Stable Non-crossing Matchings;minimum Maximal Acyclic Matching in Proper Interval Graphs;fault-Tolerant Dispersion of Mobile Robots;transitivity on Subclasses of Chordal Graphs;maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength;graph Covering Using Bounded Size Subgraphs;axiomatic Characterization of the Toll Walk Function of Some Graph Classes;structural Parameterization of Alliance Problems;resource Management in Device-to-Device Communications;algorithms for k-Dispersion for Points in Convex Position in the Plane;arbitrary-Oriented Color Spanning Region for Line Segments;rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane;diverse Fair Allocations: Complexity and algorithms;new Bounds and Constructions
the proceedings contain 24 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: On cd-Coloring of { P5, K4} -free Chordal Graphs;an Output-Sensitive Algor...
ISBN:
(纸本)9783030950170
the proceedings contain 24 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: On cd-Coloring of { P5, K4} -free Chordal Graphs;an Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs;covering a Graph with Densest Subgraphs;coresets for (k, ) -Median Clustering Under the Fréchet Distance;bounds and algorithms for Geodetic Hulls;voronoi Games Using Geodesics;approximation and Parameterized algorithms for Balanced Connected Partition Problems;algorithms for Online Car-Sharing Problem;algebraic algorithms for Variants of Subset Sum;chromatic Bounds for Some Subclasses of (P3∪ P2) -free graphs;hardness and Approximation Results for Some Variants of Stable Marriage Problem;on Fair Division with Binary Valuations Respecting Social Networks;parameterized Intractability of Defensive Alliance Problem;on the Approximability of Path and Cycle Problems in Arc-Dependent Networks;approximation algorithms in Graphs with Known Broadcast Time of the Base Graph;list Homomorphisms to Separable Signed Graphs;some Position Problems for Graphs;comparability Graphs Among Cover-Incomparability Graphs;Complexity of Paired Domination in AT-free and Planar Graphs;the Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs;on Conflict-Free Spanning Tree: algorithms and Complexity;B0 -VPG Representation of AT-free Outerplanar Graphs.
the proceedings contain 39 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: Parameterized Complexity of Locally Minimal Defensive Alliances;new Varian...
ISBN:
(纸本)9783030678982
the proceedings contain 39 papers. the special focus in this conference is on algorithms and discreteappliedmathematics. the topics include: Parameterized Complexity of Locally Minimal Defensive Alliances;new Variants of Perfect Non-crossing Matchings;cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data;a Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes;on the Intersections of Non-homotopic Loops;on cd-Coloring of Trees and Co-bipartite Graphs;cut Vertex Transit Functions of Hypergraphs;lexicographic Product of Digraphs and Related Boundary-Type Sets;the Connected Domination Number of Grids;scheduling Trains with Small Stretch on a Unidirectional Line;on Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs;cops and Robber on Butterflies and Solid Grids;b-Coloring of Some Powers of Hypercubes;chromatic Bounds for the Subclasses of pK2 -Free Graphs;axiomatic Characterization of the Median Function of a Block Graph;on Coupon Coloring of Cartesian Product of Some Graphs;on the Connectivity and the Diameter of Betweenness-Uniform Graphs;on algorithms to Find p-ordering;experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem;algorithmic Analysis of Priority-Based Bin Packing;algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs;recursive Methods for Some Problems in Coding and Random Permutations;achieving Positive Rates with Predetermined Dictionaries;characterization of Dense Patterns Having Distinct Squares;failure and Communication in a Synchronized Multi-drone System;memory Optimal Dispersion by Anonymous Mobile Robots;quantum and Approximation algorithms for Maximum Witnesses of Boolean Matrix Products;balanced Connected Graph Partition.
In order to solve the problems of small key space and simple chaotic behavior of low-dimensional chaotic systems in discrete domain, an N-dimensional discrete chaotic mapping system is proposed. An N-dimensional discr...
详细信息
ISBN:
(纸本)9798350349122;9798350349115
In order to solve the problems of small key space and simple chaotic behavior of low-dimensional chaotic systems in discrete domain, an N-dimensional discrete chaotic mapping system is proposed. An N-dimensional discrete chaotic system is obtained by coupling Chebyshev mapping with ICMIC mapping. Taking two-dimensional chaotic mapping as an example, the Lyapunov index, bifurcation graph, correlation and other properties of the discrete chaotic system are analyzed and applied to more classical image encryption algorithms. Experimental simulation results show that the N-dimensional discrete chaotic mapping system has larger key space, better chaotic behavior, and better security performance for image encryption algorithms.
this paper presents a speech emotion recognition system. the features are extracted by the discrete Wavelet Transform method (DWT) withthe calculation of energy, variance, skewness, standard deviation, average and ku...
详细信息
this paper introduces one stochastic approximation consensus type algorithm for discrete-time multi-agent systems (MASs) under general matrix-weighted topologies. By analyzing the consensus error convergence, we estab...
详细信息
Given a set P of n points in the plane, in general position, denote by N-Delta(P) the number of empty triangles with vertices in P. In this paper we investigate by how much N-Delta(P) changes if a point x is removed f...
详细信息
ISBN:
(纸本)9783031522123;9783031522130
Given a set P of n points in the plane, in general position, denote by N-Delta(P) the number of empty triangles with vertices in P. In this paper we investigate by how much N-Delta(P) changes if a point x is removed from P. By constructing a graph G(P)(x) based on the arrangement of the empty triangles incident on x, we transform this geometric problem to the problem of counting triangles in the graph G(P)(x). We study properties of the graph G(P)(x) and, in particular, show that it is kite-free. this relates the growth rate of the number of empty triangles to the famous Ruzsa-Szemeredi problem.
暂无评论