Search

Showing total 14,746 results
Start Over Topic discrete mathematics Publication Year Range Last 50 years Language english

Refine your results

more »

more »

more »

more »

more »

more »
14,746 results

1. Partner choice correlates with fine scale kin structuring in the paper wasp Polistes dominula

Author

Paul J. Parsons, Jeremy Field, and Lena Grinsted

Subjects
0106 biological sciences, 0301 basic medicine, Topography, Heredity, Wasps, NERC, Social Sciences, 01 natural sciences, Nesting Behavior, Habits, Nest, Psychology, Inbreeding, Islands, education.field_of_study, Multidisciplinary, Behavior, Animal, biology, Agricultural and Biological Sciences(all), Eusociality, Spring, Databases as Topic, Physical Sciences, NE/M003191/1, Medicine, Female, Seasons, Research Article, Statistical Distributions, Kin recognition, Permutation, Science, Population, Cuticular Hydrocarbons, Insect Physiology, Polistes dominula, NE/K00655X/1, 010603 evolutionary biology, Nesting Habits, 03 medical and health sciences, Genetics, Animal Physiology, Animals, Social Behavior, education, General, Invertebrate Physiology, Paper wasp, Evolutionary Biology, Behavior, Landforms, Population Biology, Discrete Mathematics, Biochemistry, Genetics and Molecular Biology(all), Biology and Life Sciences, RCUK, Geomorphology, Probability Theory, biology.organism_classification, Statistical Dispersion, 030104 developmental biology, Natal homing, Combinatorics, Evolutionary biology, Earth Sciences, Philopatry, Zoology, Entomology, Population Genetics, Mathematics
Abstract

Cooperation among kin is common in animal societies. Kin groups may form by individuals directly discriminating relatives based on kin recognition cues, or form passively through natal philopatry and limited dispersal. We describe the genetic landscape for a primitively eusocial wasp, Polistes dominula, and ask whether individuals choose cooperative partners that are nearby and/or that are genetic relatives. Firstly, we genotyped an entire sub-population of 1361 wasps and found genetic structuring on an extremely fine scale: the probability of finding genetic relatives decreases exponentially within just a few meters of an individual’s nest. At the same time, however, we found a lack of genetic structuring between natural nest aggregations within the population. Secondly, in a separate dataset where ~2000 wasps were genotyped, we show that wasps forced experimentally to make a new nest choice tended to choose new nests near to their original nests, and that these nests tended to contain some full sisters. However, a significant fraction of wasps chose nests that did not contain sisters, despite sisters being present in nearby nests. Although we cannot rule out a role for direct kin recognition or natal nest-mate recognition, our data suggest that kin groups may form via a philopatric rule-of-thumb, whereby wasps simply select groups and nesting sites that are nearby. The result is that most subordinate helpers obtain indirect fitness benefits by breeding cooperatively.

Published
2019

2. Parametric analysis of paper machine as object of automatic control

Subjects
Physics, Discrete mathematics, paper manufacture technology, paper machine, control effects, perturbation, lcsh:Technology (General), lcsh:T1-995, lcsh:Business, lcsh:HF5001-6182, automation
Abstract

The results of analyzing the process of paper manufacture on the paper machine (PM) in terms of automatic control problems are given in the paper. They are presented in the form of parametric schemes of each part of the PM indicating the main input and output variables, as well as control and perturbation effects. Wire, drying and press parts, sections of pulp preparation, wet washing, screening, inlet and calender are considered in the paper. Construction of parametric schemes is the first step in creating an automatic control system. Based on the obtained results, it is concluded that the most attention from the point of view of control should be given to the PM drying section and calender. The conclusion is associated with a large number of perturbations, acting on these processes and negatively affecting the quality of the finished products but also lead to increasing production costs. With the set parameters of the PM processes, it is possible to formulate an optimal control problem that is the next step in creating an automatic control system.

Published
2014

3. Correction and notes to the paper 'A classification of Artin–Schreier defect extensions and characterizations of defectless fields'

Author

Franz-Viktor Kuhlmann

Subjects
Discrete mathematics, Lemma (mathematics), 14B05, General Mathematics, 13A18, 010102 general mathematics, 12J10, Mistake, Commutative Algebra (math.AC), Linearly disjoint, Mathematics - Commutative Algebra, 01 natural sciences, Primary 12J10, 13A18, Secondary 12J25, 12L12, 14B05, Field extension, 0103 physical sciences, FOS: Mathematics, 010307 mathematical physics, 0101 mathematics, 12J25, 12L12, Mathematics
Abstract

We correct a mistake in a lemma in the paper cited in the title and show that it did not affect any of the other results of the paper. To this end, we prove results on linearly disjoint field extensions that do not seem to be commonly known. We give an example to show that a separability assumption in one of these results cannot be dropped (doing so had led to the mistake). Further, we discuss recent generalizations of the original classification of defect extensions.

Published
2019

4. Partner choice correlates with fine scale kin structuring in the paper wasp Polistes dominula.

Author

Parsons, Paul John, Grinsted, Lena, and Field, Jeremy

Subjects
*PHILOPATRY, *WASPS, *ANIMAL societies, *PHYSIOLOGY, *NESTS, *BIRD breeding
Abstract

Cooperation among kin is common in animal societies. Kin groups may form by individuals directly discriminating relatives based on kin recognition cues, or form passively through natal philopatry and limited dispersal. We describe the genetic landscape for a primitively eusocial wasp, Polistes dominula, and ask whether individuals choose cooperative partners that are nearby and/or that are genetic relatives. Firstly, we genotyped an entire sub-population of 1361 wasps and found genetic structuring on an extremely fine scale: the probability of finding genetic relatives decreases exponentially within just a few meters of an individual’s nest. At the same time, however, we found a lack of genetic structuring between natural nest aggregations within the population. Secondly, in a separate dataset where ~2000 wasps were genotyped, we show that wasps forced experimentally to make a new nest choice tended to choose new nests near to their original nests, and that these nests tended to contain some full sisters. However, a significant fraction of wasps chose nests that did not contain sisters, despite sisters being present in nearby nests. Although we cannot rule out a role for direct kin recognition or natal nest-mate recognition, our data suggest that kin groups may form via a philopatric rule-of-thumb, whereby wasps simply select groups and nesting sites that are nearby. The result is that most subordinate helpers obtain indirect fitness benefits by breeding cooperatively. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

5. A note on Lavi’s paper 'A Ganzstellensatz for semi-algebraic sets and a boundedness criterion for rational functions'

Author

Tomasz Kowalczyk

Subjects
Model theory, Discrete mathematics, Computer Science::Computer Science and Game Theory, Algebra and Number Theory, valuation theory, 010102 general mathematics, 010103 numerical & computational mathematics, Valuation theory, Rational function, 01 natural sciences, Algebra, model theory, Real algebraic geometry, real algebraic geometry, 0101 mathematics, Algebraic number, Mathematics
Abstract

This article is intended to indicate and discuss some errors in N. Lavi’s paper “A Ganzstellensatz for semi-algebraic sets and a boundedness criterion for rational functions”.

Published
2018

6. On the relation between Schubert's h-index of a single paper and its total number of received citations

Author

Leo Egghe

Subjects
Discrete mathematics, Single paper h-index, Single paper Hirsch-index, Power law, Calculus, General Social Sciences, Library and Information Sciences, Scientometrics, Relation (history of concept), Computer Science Applications, Mathematics
Abstract

A relation, established by Andras Schubert (Scientometrics 78(3): 559–565, 2009) on the relation between a paper’s h-index and its total number of received citations, is explained. The relation is a concavely increasing power law and is explained based on the Lotkaian model for the h-index, proved by Egghe and Rousseau.

Published
2010

7. Probabilities for encountering genius, basic, ordinary or insignificant papers based on the cumulative nth citation distribution

Author

Leo Egghe

Subjects
Discrete mathematics, Class (set theory), Basis (linear algebra), Cumulative distribution function, media_common.quotation_subject, General Social Sciences, Context (language use), Function (mathematics), Library and Information Sciences, Genius, Computer Science Applications, cumulative citation distribution, genius paper, basic paper, ordinary paper, insignificant paper, Citation analysis, Calculus, Citation, Mathematics, media_common
Abstract

This article calculates probabilities for the occurrence of different types of papers such as genius papers, basic papers, ordinary papers or insignificant papers. The basis of these calculations are the formulae for the cumulative n-th citation distribution, being the cumulative distribution of times at which articles receive their n-th (n=1,2,3,...) citation. These formulae (proved in previous papers) are extended to allow for different aging rates of the papers. These new results are then used to define different importance classes of papers according to the different values of n, in function of time t. Examples are given in case of a classification into four parts: genius papers, basic papers, ordinary papers and (almost) insignificant papers. The fact that, in these examples, the size of each class is inversely related to the importance of the journals in this class is proved in a general mathematical context in which we have an arbitrary number of classes and where the threshold values of n in each class are defined according to the natural law of Weber-Fechner.

Published
2007

8. Translation of Michael Sadowsky's paper 'The differential equations of the M\'obius band'

Author

Denis F. Hinz and Eliot Fried

Subjects
Discrete mathematics, Mechanics of Materials, Differential equation, Mechanical Engineering, Philosophy, Mathematics - History and Overview, Physics - History and Philosophy of Physics, General Materials Science, Translation (geometry)
Abstract

This article is a translation of Michael Sadowsky's original paper "Die Differentialgleichungen des M\"obiusschen Bandes." in Jahresbericht der Deutschen Mathematiker-Vereinigung 39 (2. Abt. Heft 5/8, Jahresversammlung vom 16. bis 23. September), 49-51 (1929), which is a short version of his paper "Theorie der elastisch biegsamen undehnbaren B\"ander mit Anwendungen auf das M\"obiussche Band" in 3. internationaler Kongress f\"ur technische Mechanik, Stockholm, 1930., Comment: 4 pages, to appear in a special volume of the Journal of Elasticity entitled "The Mechanics of Ribbons and M\"obius Bands", citations of this translation should refer also to Sadowsky's original paper, as cited in the Abstract

Published
2014

9. A note on the paper 'Minimizing total tardiness on parallel machines with preemptions' by Kravchenko and Werner (2012)

Author

Chams Lahlou, Odile Bellenguez-Morineau, Damien Prot, Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN), Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN), Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS), Mines Nantes (Mines Nantes), Systèmes Logistiques et de Production (SLP), and Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN)

Subjects
Discrete mathematics, 021103 operations research, Supply chain management, Tardiness, 0211 other engineering and technologies, General Engineering, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Mathematical proof, 01 natural sciences, Scheduling (computing), 010201 computation theory & mathematics, Artificial Intelligence, Algorithm, Software, Mathematics
Abstract

International audience; In this note, we point out two major errors in the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012). More precisely, they claimed to have proved that both problems P|pmtn|∑T j and P|r j ,p j =p,pmtn|∑T j are NP -Hard. We give a counter-example to their proofs, letting the complexity of these two problems open.

Published
2013

10. Comments on the paper 'Attacking the market split problem with lattice point enumeration'

Author

Karen Aardal

Subjects
Discrete mathematics, Control and Optimization, Computational Theory and Mathematics, Applied Mathematics, Diophantine equation, Theory of computation, Enumeration, Discrete Mathematics and Combinatorics, Combinatorial optimization, Integer programming, Linear equation, Computer Science Applications, Mathematics
Abstract

We present a few comments on the paper "Attacking the market split problem with lattice point enumeration" by A. Wasserman, published in Journal of Combinatorial Optimization, vol. 6, pp. 5–16, 2002.

Published
2004

12. Rebuttal of Donnelly's paper on the spectral gap

Author

Antoine Henrot, Mark S. Ashbaugh, Richard S. Laugesen, Department of Mathematics, University of Missouri Columbia, University of Missouri [Columbia] (Mizzou), University of Missouri System-University of Missouri System, Institut Élie Cartan de Nancy (IECN), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Robust control of infinite dimensional systems and applications (CORIDA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), Department of Mathematics [Urbana], University of Illinois at Urbana-Champaign [Urbana], University of Illinois System-University of Illinois System, CORIDA, and Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est

Subjects
Discrete mathematics, Sequence, Conjecture, General Mathematics, 010102 general mathematics, Mathematics::History and Overview, Mathematics::Spectral Theory, 01 natural sciences, Domain (mathematical analysis), Computer Science::Computers and Society, 010101 applied mathematics, symbols.namesake, Physics::Popular Physics, Dirichlet boundary condition, Euclidean geometry, symbols, Calculus, Convex body, Quantitative Biology::Populations and Evolution, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Spectral gap, 0101 mathematics, Mathematics, Unit interval
Abstract

The spectral gap conjecture of M. van den Berg [2, formula (65)] asserts that λ2 − λ1 ≥ 3π for all convex euclidean domains of diameter 1, where λ1 and λ2 denote the first two eigenvalues of the Dirichlet Laplacian. Notice that equality holds for the 1-dimensional unit interval, which can be regarded also as a degenerate n-dimensional rectangular box. The gap estimate is conjectured to hold more generally for Schrodinger operators with convex potentials, under Dirichlet boundary conditions; see the work of S.-T. Yau and collaborators [9, 11]. This Schrodinger gap conjecture was proved some time ago in 1 dimension by R. Lavine [8], and more recently in all dimensions by B. Andrews and J. Clutterbuck [1]. The proof in this journal by H. Donnelly [3] of the original gap conjecture in 2 dimensions (for the Dirichlet Laplacian with zero potential) is not correct. The Editors of Mathematische Zeitschrift have asked us to describe the flaws in the proof, in order to clarify the state of the literature. Donnelly’s approach to the problem is a natural one: first perform a shape optimization to rule out a non-degenerate minimizing domain, and then analyze the spectral gap for a sequence of domains degenerating to an interval, with the help of results by D. Jerison [5]. (For some history on this approach, and on the gap conjecture more generally, see the report on the AIM meeting “Low Eigenvalues of Laplace and Schrodinger Operators” [10], especially page 12 of the open problems list.) The error lies in the proof of the shape optimization step, as we now explain. Donnelly wishes to prove that no minimizing domain can exist for

Published
2011

13. Note on a paper by A. Granville and K. Soundararajan

Author

Jie Wu, Institut Élie Cartan de Nancy (IECN), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), and Wu, Jie

Subjects
Discrete mathematics, Algebra and Number Theory, Distribution (number theory), 010102 general mathematics, Equal probability, 01 natural sciences, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], Combinatorics, symbols.namesake, Results on L(1,χ), \chi)$, 0103 physical sciences, symbols, Results on $L(1, 010307 mathematical physics, 11M20, 0101 mathematics, Random variable, Euler product, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT], Mathematics
Abstract

In this note, we improve some results of Granville and Soundararajan on the distribution of values of the truncated random Euler product L ( 1 , X ; y ) : = ∏ p ⩽ y ( 1 − X ( p ) / p ) −1 , where the X ( p ) are independent random variables, taking the values ±1 with equal probability p / 2 ( p + 1 ) and 0 with probability 1 / ( p + 1 ) .

Published
2007

14. A REMARK ON A PAPER OF BLASCO

Author

Z. Ercan

Subjects
Discrete mathematics, point evaluating homomorphism, Algebra homomorphism, General Mathematics, Subalgebra, Hausdorff space, Mathematics::General Topology, algebra homomorphisms, Coimage, 54C35, Combinatorics, countable evaluating homomorphism, Bounded function, Lindelöf space, Homomorphism, 46E25, Group homomorphism, Mathematics
Abstract

We generalize and give a simple proof of a Theorem of Blasco. For a topological space X , C(X) denotes the algebra of real valued continuous functions on X under the operation (αf + gh)(x) := αf(x) + h(x)g(x) for each f, g, h ∈ C(X) and α ∈ R. An algebra A on X means a subalgebra of C(X) which contains the constant functions. By a ∗-algebra A on X we mean an algebra on X and all bounded functions in A separate points from the closed sets. Let A be an algebra on X and π : A −→ R be a (algebra) homomorphism and α be a cardinal number. π is said to be α-evaluating if for each subset B of A with cardinality at most α there exits xB ∈ X such that π(f) = f(xB) for each f ∈ B. If α = |N|(=the cardinal number of the set of the natural numbers N), the α-evaluating homomorphism is called countable evaluating. Let α be a cardinal number. Recall that a topological space X is called αLindelof if for each open cover U has a subcover V such that the cardinality of V is at most α. A lindelof space means a |N|-Lindelof space. The following theorem is given in [1] as one of the main results. Theorem 1. Let X be a completely regular Hausdorff space. Then X is Lindelof if and only if each countable evaluating homomorphism π on a ∗-algebra A on X is point evaluating. Received June 9, 2004; accepted June 30, 2004. Communicated by Bor-Luh Lin. 2000 Mathematics Subject Classification: Primary 54C35, 46E25.

Published
2006

15. How Popular is Your Paper? An Empirical Study of the Citation Distribution

Author

Sidney Redner

Subjects
Discrete mathematics, Statistical Mechanics (cond-mat.stat-mech), Zipf's law, FOS: Physical sciences, Condensed Matter Physics, 01 natural sciences, Plot (graphics), 010305 fluids & plasmas, Electronic, Optical and Magnetic Materials, Empirical research, 0103 physical sciences, Exponent, Rank (graph theory), Citation distribution, 010306 general physics, Citation, Condensed Matter - Statistical Mechanics, Mathematics
Abstract

Numerical data for the distribution of citations are examined for: (i) papers published in 1981 in journals which are catalogued by the Institute for Scientific Information (783,339 papers) and (ii) 20 years of publications in Physical Review D, vols. 11-50 (24,296 papers). A Zipf plot of the number of citations to a given paper versus its citation rank appears to be consistent with a power-law dependence for leading rank papers, with exponent close to -1/2. This, in turn, suggests that the number of papers with x citations, N(x), has a large-x power law decay N(x)~x^{-alpha}, with alpha approximately equal to 3., 4 pages, 4 figures, 1 table, revtex 2 column format. A small error in the description of one of the data sets corrected, no change in results

Published
1998

16. An addendum to Popa's paper

Author

Berhane T. Ghaim

Subjects
Discrete mathematics, Mathematics (miscellaneous), Mathematics Subject Classification, Simple (abstract algebra), Addendum, Spectral theorem, Operator theory, Compact operator, Operator norm, Compact operator on Hilbert space, Mathematics
Abstract

In this note we make a few simple observations regarding examples of D. Popa (cf. [3]) concerning weakly compact operators on C [0,1] and other related classes. Mathematics Subject Classification (2000): 46B28, 46B50, 46E15, 46G12. Key words: Weakly compact operators; compact operators; nuclear operators; absolutely summing operators. Quaestiones Mathematicae 26(2003), 53-56.

Published
2004

17. Letters to the Editor on the Paper ‘Fault Detection and Isolation for State Affine Systems’ by H. Hammouri, M. Kinnaert and E. H. El Yaagoubi

Author

Alberto Isidori, C. De Persis, Engineering and Technology Institute Groningen, and Smart Manufacturing Systems

Subjects
Discrete mathematics, Algebraic equation, General Engineering, State (functional analysis), Affine transformation, Algebraic number, Fault detection and isolation, Mathematics
Abstract

In this note we show how to test whether or not certain algebraic equations derived in the paper 'Fault Detection and Isolation for State Affine Systems', by H. Hammouri, M. Kinnaert, E.H. El Yaagoubi, are solvable and to describe a solution method. Test and solution rely upon elementary linear algebraic techniques.

Published
2000

20. Introduction to the Special Issue: Resources for Undergraduate Cryptology.

Author

Boersma, Stuart, Christensen, Chris, and Millichap, Christian

Subjects
CRYPTOGRAPHY, COMPUTATIONAL mathematics, UNDERGRADUATES, NUMBER theory
Abstract

This editorial introduces the special issue, Resources for Undergraduate Cryptology. We begin by describing possible roles for cryptology in the undergraduate mathematics curriculum together with a brief overview of the subject. We conclude with a brief preview of each paper included in this issue. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

21. Mathematical coding theory and its applications.

Author

Solé, Patrick

Subjects
DISCRETE mathematics, FIXED point theory, NONCOMMUTATIVE rings, GENERAL relativity (Physics), ALGEBRAIC coding theory
Abstract

This document is an editorial for a special issue of the journal AIMS Mathematics on "Mathematical Coding Theory and its Applications." The issue includes 8 papers that explore various aspects of coding theory, which involves techniques from commutative algebra, discrete mathematics, and the geometry of numbers. The papers cover topics such as codes over rings (including non-commutative and non-unitary rings), codes for alternative metrics, and codes as ideals in special rings. The issue also includes papers on codes over fields, including finite fields and number fields. The guest editor for the special issue is Professor Patrick Solé from the University of Aix-Marseille in France. [Extracted from the article]

Published
2024
Full Text
View/download PDF

22. Retrospectively Using Discrete Mathematics Concepts to Develop a Robust Ranking System for the 2019 Ice Cricket World Cup.

Author

VON KUSTER, JEFF

Subjects
DISCRETE mathematics, SPORTS team ranking, GRAPH theory
Abstract

The 2019 ICC Cricket World Cup was held from May 30 to July 14 in England and Wales with a new tournament format being used. The competition was reduced to ten teams, in a single pool, with each team scheduled to play every one of the other nine teams. The purpose of such a tournament is to identify the strongest or most dominant teams, but this was thwarted in the 2019 Cricket World Cup by the scoring system, in particular the use of net run rate to rank teams tied on points awarded for wins, draws and ‘no result’ matches. Concepts from discrete mathematics, in particular graph theory, are applied to create a ranking system better suited to this type of tournament. The dominance graph for matches between the top five teams shows that the team which came fourth, under the current system, was dominated by the team placed in fifth position. This paper shows how the use of net run rate may be replaced by calculating one stage, two stages and if necessary three stage dominances, to rank teams. These calculations are easily done using a dominance matrix. Recommendations to ensure that the strongest teams play in the final match, for the cup, are made and it is suggested that the group stage of the FIFA Football World Cup use the scoring method explained in this paper. [ABSTRACT FROM AUTHOR]

Published
2023

23. Graph Drawing and Network Visualization : 31st International Symposium, GD 2023, Isola Delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part I

Author

Michael A. Bekos, Markus Chimani, Michael A. Bekos, and Markus Chimani

Subjects
Computer science, Computer science—Mathematics, Discrete mathematics, Image processing—Digital techniques, Computer vision, Data structures (Computer science), Information theory, Application software, Signal processing
Abstract

This two-volume set LNCS 14465-14466 constitutes the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, GD 2023, held in Isola delle Femmine, Palermo, Italy, in September 2023. The 31 full papers, 7 short papers, presented together with 2 invited talks, and one contest report, were thoroughly reviewed and selected from the 100 submissions. The abstracts of 11 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: beyond planarity; crossing numbers; linear layouts; geometric aspects; visualization challenges; graph representations; graph decompositions; topological aspects; parameterized complexity for drawings; planar graphs; frameworks; algorithmics.

Published
2024

24. Artificial Intelligence and Image Analysis : 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8–10, 2024, Revised Selected Papers

Author

Reneta P. Barneva, Valentin E. Brimkov, Claudio Gentile, Aldo Pacchiano, Reneta P. Barneva, Valentin E. Brimkov, Claudio Gentile, and Aldo Pacchiano

Subjects
Computer vision, Image processing, Computer science—Mathematics, Discrete mathematics, Artificial intelligence, Computer networks
Abstract

This book constitutes the refereed joint proceedings of the 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and the 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, held in Fort Lauderdale, FL, USA, during January 8–10, 2024. The 14 full papers presented were carefully reviewed and selected from 25 submissions. The papers cover topics from AI, theoretical computer science, mathematics, medicine, robotics, defense, and security.

Published
2024

25. Rewriting Logic and Its Applications : 15th International Workshop, WRLA 2024, Luxembourg City, Luxembourg, April 6–7, 2024, Revised Selected Papers

Author

Kazuhiro Ogata, Narciso Martí-Oliet, Kazuhiro Ogata, and Narciso Martí-Oliet

Subjects
Software engineering, Computer science, Machine theory, Computer engineering, Computer networks, Computer science—Mathematics, Discrete mathematics
Abstract

This book constitutes revised selected papers from the refereed proceedings of the 15th International Workshop on Rewriting Logic and Its Applications, WRLA 2024, held in Luxembourg City, Luxembourg, during April 6–7, 2024. The 11 full papers included in this book were carefully reviewed and selected from 16 submissions. They focus on several topics, e.g., foundations; rewriting as a logical and semantic framework; rewriting languages; verification techniques; applications; and education.

Published
2024

26. Mathematical Optimization Theory and Operations Research: Recent Trends : 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Revised Selected Papers

Author

Michael Khachay, Yury Kochetov, Anton Eremeev, Oleg Khamisov, Vladimir Mazalov, Panos Pardalos, Michael Khachay, Yury Kochetov, Anton Eremeev, Oleg Khamisov, Vladimir Mazalov, and Panos Pardalos

Subjects
Computer science—Mathematics, Artificial intelligence, Algorithms, Data structures (Computer science), Information theory, Discrete mathematics
Abstract

This book constitutes refereed proceedings of the 22nd International Conference on Mathematical Optimization Theory and Operations Research: Recent Trends, MOTOR 2023, held in Ekaterinburg, Russia, during July 2–8, 2023. The 28 full papers and one invited paper presented in this volume were carefully reviewed and selected from a total of 61 submissions. The papers in the volume are organized according to the following topical headings: mathematical programming; stochastic optimization; discrete and combinatorial optimization; operations research; optimal control and mathematical economics; and optimization in machine learning.

Published
2023

27. Variable Neighborhood Search : 9th International Conference, ICVNS 2022, Abu Dhabi, United Arab Emirates, October 25–28, 2022, Revised Selected Papers

Author

Andrei Sleptchenko, Angelo Sifaleras, Pierre Hansen, Andrei Sleptchenko, Angelo Sifaleras, and Pierre Hansen

Subjects
Computer science—Mathematics, Discrete mathematics, Algorithms
Abstract

This volume constitutes the proceedings of the 9th International Conference on Variable Neighborhood Search, ICVNS 2023, held in Abu Dhabi, United Arab Emirates, in October 2022.The 11 full papers presented in this volume were carefully reviewed and selected from 29 submissions. The papers describe recent advances in methods and applications of variable neighborhood search.

Published
2023

28. Graph Drawing and Network Visualization : 30th International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers

Author

Patrizio Angelini, Reinhard von Hanxleden, Patrizio Angelini, and Reinhard von Hanxleden

Subjects
Computer science, Computer science—Mathematics, Discrete mathematics, Computer vision, Data structures (Computer science), Information theory, Database management, Signal processing
Abstract

This book constitutes the proceedings of the 30th International Symposium on Graph Drawing and Network Visualization, GD 2022, held in Tokyo, Japan, during September 13-16, 2022. The 25 full papers, 7 short papers, presented together with 2 invited talks, one report on graph drawing contest, and one obituary in these proceedings were carefully reviewed and selected from 70 submissions. The abstracts of 5 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: properties of drawings of complete graphs; stress-based visualizations of graphs; planar and orthogonal drawings; drawings and properties of directed graphs; beyond planarity; dynamic graph visualization; linear layouts; and contact and visibility graph representations.

Published
2023

29. Combinatorial Optimization : 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers

Author

Ivana Ljubić, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub, Ivana Ljubić, Francisco Barahona, Santanu S. Dey, and A. Ridha Mahjoub

Subjects
Computer science—Mathematics, Discrete mathematics, Computer networks, Algorithms, Data structures (Computer science), Information theory, Numerical analysis, Artificial intelligence
Abstract

This book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022.The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms.

Published
2022

30. Rewriting Logic and Its Applications : 14th International Workshop, WRLA 2022, Munich, Germany, April 2–3, 2022, Revised Selected Papers

Author

Kyungmin Bae and Kyungmin Bae

Subjects
Computer science, Software engineering, Machine theory, Computer engineering, Computer networks, Computer science—Mathematics, Discrete mathematics
Abstract

This book constitutes selected papers from the refereed proceedings of the 14th International Workshop on Rewriting Logic and Its Applications, WRLA 2022, held in Munich, Germany, in April 2022.The 9 full papers included in this book were carefully reviewed and selected from 13 submissions. They focus on topics in rewriting logic and its applications. The book also contains 2 invited papers, 2 invited tutorials and an experience report.

Published
2022

31. Mathematical Optimization Theory and Operations Research: Recent Trends : 21st International Conference, MOTOR 2022, Petrozavodsk, Russia, July 2–6, 2022, Revised Selected Papers

Author

Yury Kochetov, Anton Eremeev, Oleg Khamisov, Anna Rettieva, Yury Kochetov, Anton Eremeev, Oleg Khamisov, and Anna Rettieva

Subjects
Data structures (Computer science), Information theory, Computer science—Mathematics, Discrete mathematics, Numerical analysis, Algorithms, Artificial intelligence
Abstract

This book constitutes refereed proceedings of the 21st International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2022, held in Petrozavodsk, Russia, in July 2022. The 21 full papers and 3 short papers presented in this volume were carefully reviewed and selected from a total of 88 submissions. The papers in the volume are organised according to the following topical headings: ​invited talks; integer programming and combinatorial optimization; mathematical programming; game theory and optimal control; operational research applications.

Published
2022

32. Discrete-to-Continuous Extensions: Lovász Extension and Morse Theory.

Author

Jost, Jürgen and Zhang, Dong

Subjects
*DISCRETE mathematics, *MORSE theory, *HYPERGRAPHS, *MATHEMATICAL complexes
Abstract

This is the first of a series of papers that develop a systematic bridge between constructions in discrete mathematics and the corresponding continuous analogs. In this paper, we establish an equivalence between Forman's discrete Morse theory on a simplicial complex and the continuous Morse theory (in the sense of any known non-smooth Morse theory) on the associated order complex via the Lovász extension. Furthermore, we propose a new version of the Lusternik–Schnirelman category on abstract simplicial complexes to bridge the classical Lusternik–Schnirelman theorem and its discrete analog on finite complexes. More generally, we can suggest a discrete Morse theory on hypergraphs by employing piecewise-linear (PL) Morse theory and Lovász extension, hoping to provide new tools for exploring the structure of hypergraphs. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

33. STEVIĆ--SHARMA TYPE OPERATORS FROM H∞ INTO THE BLOCH SPACE.

Author

QINGHUA HU and XIAOJING ZHOU

Subjects
NORMAL operators, MATHEMATICAL inequalities, LINEAR algebra, POLYNOMIALS, DISCRETE mathematics
Abstract

In this paper, we give some characterizations for the boundedness and compactness of some Stević-Sharma type operators called the polynomial differentiation composition operators from H∞ into the Bloch space on the unit disk. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

34. FRAME INEQUALITIES IN HILBERT SPACES: TWO--SIDED INEQUALITIES WITH NEW STRUCTURES.

Author

ZHONG-QI XIANG, CHUN-XIA LIN, and XIANG-CHUN XIAO

Subjects
HILBERT space, MATHEMATICAL inequalities, POLYNOMIALS, LINEAR algebra, DISCRETE mathematics
Abstract

This paper is devoted to establishing frame inequalities in Hilbert spaces. By using operator theory methods, several two-sided inequalities for frames are presented, which, comparing to previous inequalities on frames and generalized frames, admit new structures. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

35. SOME WEIGHTED DYNAMIC INEQUALITIES OF HARDY TYPE WITH KERNELS ON TIME SCALES NABLA CALCULUS.

Author

AWWAD, ESSAM and SAIED, A. I.

Subjects
CALCULUS, POLYNOMIALS, MATHEMATICAL inequalities, DISCRETE mathematics, LINEAR algebra
Abstract

In this paper, we present some properties of the time scale nabla calculus and how to apply it for proving the dynamic inequalities. Also, we prove some weighted dynamic inequalities of Hardy type with kernels on time scales nabla calculus and also, we study the characterizations of the weights for these inequalities in different spaces and for the exponent p > 1. The Holder inequality, Jensen inequality, and Minkowski inequality are used to prove our results. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

36. GENERALIZATIONS OF HARDY--TYPE INEQUALITIES BY THE HERMITE INTERPOLATING POLYNOMIAL.

Author

HIMMELREICH, KRISTINA KRULIĆ, PEČARIĆ, JOSIP, POKAZ, DORA, and PRALJAK, MARJAN

Subjects
POLYNOMIALS, MATHEMATICAL inequalities, DISCRETE mathematics, LINEAR algebra, STATISTICAL correlation
Abstract

In this paper we obtain generalizations of Hardy-type inequalities for convex functions of the higher order by applying Hermite interpolating polynomials. The results for particular cases: Lagrange, (m,n-m) and two-point Taylor interpolating polynomials are also considered. Finally, we derive the Grüss and Ostrowski type inequalities related to these generalizations. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

37. JENSEN--MARSHALL--KY FAN--TYPE INEQUALITIES AND THEIR APPLICATIONS IN BUSINESS PROFIT MANAGEMENT MODEL.

Author

RU LIU, JIAJIN WEN, TIANYONG HAN, and JUN YUAN

Subjects
LINEAR algebra, DISCRETE mathematics, MATHEMATICAL inequalities, COST functions, STATISTICAL correlation
Abstract

Abstract. This paper will introduce the theory of ϕ-Jensen coefficient. By means of the functional analysis, linear algebra, discrete mathematics and inequality theories with proper hypotheses, the Jensen-type inequality, Marshall-type inequality and the Ky Fan-type inequality are obtained as follows: ... respectively, as well as we also displayed the applications of our main results in business profit management model, and some conditions such that ... hold are obtained, where p is the profit function and e is the cost function. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

38. Mathematical Optimization Theory and Operations Research: Recent Trends : 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021, Revised Selected Papers

Author

Alexander Strekalovsky, Yury Kochetov, Tatiana Gruzdeva, Andrei Orlov, Alexander Strekalovsky, Yury Kochetov, Tatiana Gruzdeva, and Andrei Orlov

Subjects
Computer science—Mathematics, Artificial intelligence, Algorithms, Data structures (Computer science), Information theory, Discrete mathematics
Abstract

This book constitutes refereed proceedings of the 20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021, held in Irkutsk, Russia, in July 2021. Due to the COVID-19 pandemic the conference was held online. The 31 full papers and 3 short papers presented in this volume were carefully reviewed and selected from a total of 102 submissions. The papers in the volume are organised according to the following topical headings: continuous optimization; integer programming and combinatorial optimization; operational research applications; optimal control.

Published
2021

39. Graph Drawing and Network Visualization : 29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers

Author

Helen C. Purchase, Ignaz Rutter, Helen C. Purchase, and Ignaz Rutter

Subjects
Computer science, Image processing—Digital techniques, Computer vision, Data structures (Computer science), Information theory, Computer science—Mathematics, Discrete mathematics
Abstract

This book constitutes the proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2021, which was held in Tübingen, Germany, during September 14-17, 2021.The 23 full papers and 5 short papers presented in these proceedings were carefully reviewed and selected from 74 submissions. The abstracts of 13 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: Best Paper (Track 1: Combinatorial and Algorithmic Aspects); Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects); Crossing Minimization and Beyond-Planarity; Morphing and Graph Abstraction; Geometric Constraints; Topological and Upward Drawings; Linear Layouts; Contact and Visibility Representations; Geometric Aspects in Graph Drawing; AI applications; and Graph Drawing Contest Report.

Published
2021

40. Autonomous Agents and Multiagent Systems : AAMAS 2017 Workshops, Best Papers, São Paulo, Brazil, May 8-12, 2017, Revised Selected Papers

Author

Gita Sukthankar, Juan A. Rodriguez-Aguilar, Gita Sukthankar, and Juan A. Rodriguez-Aguilar

Subjects
Artificial intelligence, Computer engineering, Computer networks, Data structures (Computer science), Information theory, Computer science, Electronic commerce, Computer science—Mathematics, Discrete mathematics
Abstract

This book features a selection of best papers from 13 workshops held at the International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017, held in Sao Paulo, Brazil, in May 2017. The 17 full papers presented in this volume were carefully reviewed and selected for inclusion in this volume. They cover specific topics, both theoretical and applied, in the general area of autonomous agents and multiagent systems.

Published
2017

41. Combinatorial Optimization : 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22–24, 2024, Revised Selected Papers

Author

Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González, Amitabh Basu, Ali Ridha Mahjoub, and Juan José Salazar González

Subjects
Computer science—Mathematics, Discrete mathematics, Computer networks, Algorithms, Data structures (Computer science), Information theory, Numerical analysis, Artificial intelligence
Abstract

This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22–24, 2024. The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programming for machine learning; and applications.

Published
2024

42. Identifying factors that influence students' performance through multiple linear model.

Author

Sahrin, Sharainie and Muhammad, Noryanti

Subjects
*DISCRETE mathematics, *STUDENT interests
Abstract

Predicting students' performance is absolutely essential in both educational and machine learning contexts. Prediction of students' performance will facilitate in the development of relevant future study plans for students. In this paper, the objective of the study is to identify significant variables which affected the students' performance on enhancing students' performance through multiple linear model. The study focus on mathematics subject since the subject is one of the mandatory or core subjects that is taken in the education public examination. The results show that the factor which have impacted the students' academic performance are students' interest in number and operations, students' interest in discrete Mathematics, teachers' personality and perceived technology. Hence, the result in this paper is used to assists teachers in monitoring students to provide support and integrating training programs to achieve the best results. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

43. Variable Neighborhood Search : 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3–5, 2019, Revised Selected Papers

Author

Rachid Benmansour, Angelo Sifaleras, Nenad Mladenović, Rachid Benmansour, Angelo Sifaleras, and Nenad Mladenović

Subjects
Computer science—Mathematics, Discrete mathematics, Computer networks, Artificial intelligence, Computer science
Abstract

This volume constitutes the post- conference proceedings of the 7th International Conference on Variable Neighborhood Search, ICVNS 2019, held in Rabat, Morocco, in October 2019. The 13 full papers presented in this volume were carefully reviewed and selected from 46 submissions. The papers describe recent advances in methods and applications of variable neighborhood search.

Published
2020

44. Learning and Intelligent Optimization : 14th International Conference, LION 14, Athens, Greece, May 24–28, 2020, Revised Selected Papers

Author

Ilias S. Kotsireas, Panos M. Pardalos, Ilias S. Kotsireas, and Panos M. Pardalos

Subjects
Mathematics—Data processing, Computer networks, Computer science, Computer systems, Application software, Computer science—Mathematics, Discrete mathematics
Abstract

This book constitutes the refereed post-conference proceedings on Learning and Intelligent Optimization, LION 14, held in Athens, Greece, in May 2020. The 37 full papers presented together with one invited paper have been carefully reviewed and selected from 75 submissions. LION deals with designing and engineering ways of'learning'about the performance of different techniques, and ways of using past experience about the algorithm behavior to improve performance in the future. Intelligent learning schemes for mining the knowledge obtained online or offline can improve the algorithm design process and simplify the applications of high-performance optimization methods. Combinations of different algorithms can further improve the robustness and performance of the individual components. Due to the COVID-19 pandemic, LION 14 was not held as a physical meeting.

Published
2020

45. Graph-Theoretic Concepts in Computer Science : 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers

Author

Isolde Adler, Haiko Müller, Isolde Adler, and Haiko Müller

Subjects
Computer science—Mathematics, Discrete mathematics, Algorithms, Artificial intelligence—Data processing, Mathematics—Data processing
Abstract

This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.

Published
2020

46. Approximation and Online Algorithms : 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers

Author

Evripidis Bampis, Nicole Megow, Evripidis Bampis, and Nicole Megow

Subjects
Mathematics—Data processing, Computer engineering, Computer networks, Application software, Computer science, Computer science—Mathematics, Discrete mathematics
Abstract

This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

Published
2020

47. Graph-Theoretic Concepts in Computer Science : 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers

Author

Daniël Paulusma, Bernard Ries, Daniël Paulusma, and Bernard Ries

Subjects
Discrete mathematics, Computer science—Mathematics, Algorithms, Computer graphics, Numerical analysis
Abstract

This volume constitutes the thoroughly refereed proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023. The 33 full papers presented in this volume were carefully reviewed and selected from a total of 116 submissions. The WG 2022 workshop aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications.

Published
2023

48. Frontiers of Algorithmic Wisdom : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15–19, 2022, Revised Selected Papers

Author

Minming Li, Xiaoming Sun, Minming Li, and Xiaoming Sun

Subjects
Computer science—Mathematics, Discrete mathematics, Numerical analysis, Data structures (Computer science), Information theory, Computer engineering, Computer networks, Software engineering, Algorithms
Abstract

This book constitutes the proceedings of the International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2022), for the 16th International Conference on Frontier of Algorithmic Wisdom (FAW) and the third International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, China, in August 15-19 2022.FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science.To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. In addition to four keynote speakers, 26 invited speakers and 19 contributed speakers, IJTCS-FAW2022 organized Forums for undergraduate research, young PhD graduates, young TCS faculty members, female researchers, as well as a forum in Conscious AI and a CSIAM Forum in blockchain.The 19 full papers presented in this book were carefully reviewed and selected from 25 submissions. They were organized in topical sections as follows: Algorithmic Game Theory; Game Theory in Block Chain; Frontiers of Algorithmic Wisdom; Computational and Network Economics.

Published
2023

49. Graph-Theoretic Concepts in Computer Science : 45th International Workshop, WG 2019, Vall De Núria, Spain, June 19–21, 2019, Revised Papers

Author

Ignasi Sau, Dimitrios M. Thilikos, Ignasi Sau, and Dimitrios M. Thilikos

Subjects
Mathematics—Data processing, Computer science—Mathematics, Discrete mathematics, Artificial intelligence—Data processing, Algorithms, Computer arithmetic and logic units
Abstract

This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.

Published
2019

50. Algorithms for Sensor Systems : 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Helsinki, Finland, August 23–24, 2018, Revised Selected Papers

Author

Seth Gilbert, Danny Hughes, Bhaskar Krishnamachari, Seth Gilbert, Danny Hughes, and Bhaskar Krishnamachari

Subjects
Algorithms, Artificial intelligence—Data processing, Computer science—Mathematics, Discrete mathematics, Artificial intelligence
Abstract

This book constitutes revised selected papers from the 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, held in Helsinki, Finland, in August 2018.The 15 full papers presented in this volume were carefully reviewed and selected from 39 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots. The focus is on the design and analysis of algorithms, models of computation, and experimental analysis.

Published
2019