|
Discrete Applied Mathematics
Journal Prestige (SJR): 0.785  Citation Impact (citeScore): 1 Number of Followers: 10  Hybrid journal (It can contain Open Access articles)ISSN (Print) 0166-218X - ISSN (Online) 0166-218X Published by Elsevier  [2906 journals]
|
-
r -hued+colorings—A+survey&rft.title=Discrete+Applied+Mathematics&rft.issn=0166-218X&rft.date=&rft.volume=">Graph r -hued colorings—A survey-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 15 November 2022Source: Discrete Applied Mathematics, Volume 321Author(s): Ye Chen, Suohai Fan, Hong-Jian Lai, Murong Xu
-
- Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 15 November 2022Source: Discrete Applied Mathematics, Volume 321Author(s): Min-Jen Chen, Kun-Mao Chao
-
- Complexity of edge monitoring on some graph classes
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 15 November 2022Source: Discrete Applied Mathematics, Volume 321Author(s): Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci
-
-
k -connected+and+forcibly+k -arc-connected+digraphic+sequences&rft.title=Discrete+Applied+Mathematics&rft.issn=0166-218X&rft.date=&rft.volume=">On forcibly k -connected and forcibly k -arc-connected digraphic sequences
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 15 November 2022Source: Discrete Applied Mathematics, Volume 321Author(s): Xuemei Liu, Jixiang Meng, Yingzhi Tian
-
- On intersecting families of independent sets in trees
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 15 November 2022Source: Discrete Applied Mathematics, Volume 321Author(s): Glenn Hurlbert, Vikram Kamat
-
-
k -hop+dominating+set+of+a+cactus+graph&rft.title=Discrete+Applied+Mathematics&rft.issn=0166-218X&rft.date=&rft.volume=">A linear-time algorithm for minimum k -hop dominating set of a cactus
graph-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): A. Karim Abu-Affash, Paz Carmi, Adi Krasin
-
- Adjoining to (K,s,t)-Wythoff’s game its P-generators as moves
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Haiyan Li, Wen An Liu
-
- Facet-generating procedures for the maximum-impact coloring polytope
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 30 June 2022Source: Discrete Applied MathematicsAuthor(s): Mónica Braga, Javier Marenco
-
- The Distance Orientation Problem
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 29 June 2022Source: Discrete Applied MathematicsAuthor(s): Robert Scheffler
-
- A generalization of the independence number
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 15 November 2022Source: Discrete Applied Mathematics, Volume 321Author(s): Gyula O.H. Katona
-
-
Q n -
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Jing Qu, Nanbin Cao
-
- Catching an infinitely fast robber on a grid
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): William B. Kinnersley, Nikolas Townsend
-
- Vertex removal in biclique graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 27 June 2022Source: Discrete Applied MathematicsAuthor(s): Leandro Montero
-
- Algorithmic techniques for finding resistance distances on structured
graphs-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): E.J. Evans, A.E. Francis
-
- The read once formula of a series–parallel network
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Daniele Mundici
-
- Some novel minimax results for perfect matchings of hexagonal systems
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Xiangqian Zhou, Heping Zhang
-
- Fair integral submodular flows
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): András Frank, Kazuo Murota
-
-
Q -index+of+(minimally)+2-connected+graphs+with+given+size&rft.title=Discrete+Applied+Mathematics&rft.issn=0166-218X&rft.date=&rft.volume=">Sharp upper bounds on the Q -index of (minimally) 2-connected graphs with
given size-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Shu-Guang Guo, Rong Zhang
-
- An improved lower bound for the Seidel energy of trees
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): M. Einollahzadeh, M.A. Nematollahi
-
- Well-hued graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Wayne Goddard, Kirsti Kuenzel, Eileen Melville
-
- Spanning tree enumeration and nearly triangular graph Laplacians
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Christian Go, Khwa Zhong Xuan, Xinyu Luo, Matthew T. Stamps
-
- Streaming algorithms for multitasking scheduling with shared processing
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Bin Fu, Yumei Huo, Hairong Zhao
-
- On the minimum Harary index of graphs with a given diameter or
independence number-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Bojana Borovićanin, Boris Furtula, Marija Jerotijević
-
- A family of bipartite circulant tournaments with acyclic disconnection 3
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Ilan A. Goldfeder, Nahid Y. Javier-Nol, Joaquín Tey
-
- Positive matching decompositions of graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Mohammad Farrokhi D.G., Shekoofeh Gharakhloo, Ali Akbar Yazdan Pour
-
-
K 5 , 5 ℂ 3 -
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 23 June 2022Source: Discrete Applied MathematicsAuthor(s): Daniel Irving Bernstein, Steven J. Gortler
-
- The proper 2-connection number and size of graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Trung Duy Doan, Ingo Schiermeyer
-
- Forbidden triples generating a finite set of graphs with minimum degree
three-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Yoshimi Egawa, Michitaka Furuya
-
- Coverings of planar and three-dimensional sets with subsets of smaller
diameter-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): A.D. Tolmachev, D.S. Protasov, V.A. Voronov
-
- A type of generalized mesh-star transformation and applications in
electrical networks-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Sujing Cheng, Wuxian Chen, Weigen Yan
-
- Essential obstacles to Helly circular-arc graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Martín D. Safe
-
- Bounds for the connected domination number of maximal outerplanar graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Shao-Liang Chen, Rong-Xia Hao, Xiao-Wen Qin
-
- On the algebraic immunity of direct sum constructions
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Pierrick Méaux
-
- Overlaying a hypergraph with a graph with bounded maximum degree
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 16 June 2022Source: Discrete Applied MathematicsAuthor(s): Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant
-
- Minimum degree conditions for the strength and bandwidth of graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima
-
- A note on geometric duality in matroid theory and knot theory
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Lorenzo Traldi
-
-
χ -binding+functions&rft.title=Discrete+Applied+Mathematics&rft.issn=0166-218X&rft.date=&rft.volume=">Homogeneous sets, clique-separators, critical graphs, and optimal
χ -binding functions-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
-
- Optimal identifying codes of two families of Cayley graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Min Feng, Xuanlong Ma, Lihua Feng
-
- Reachability in arborescence packings
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Florian Hörsch, Zoltán Szigeti
-
- Truncated metric dimension for finite graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Rafael M. Frongillo, Jesse Geneson, Manuel E. Lladser, Richard C. Tillquist, Eunjeong Yi
-
- Counting phylogenetic networks with few reticulation vertices: A second
approach-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Michael Fuchs, En-Yu Huang, Guan-Ru Yu
-
- Vertex and edge metric dimensions of cacti
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Jelena Sedlar, Riste Škrekovski
-
- Matrix representation of stability definitions in the graph model for
conflict resolution with grey-based preferences-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Dayong Wang, Jing Huang, Yejun Xu
-
- Disjoint cycles in graphs with restricted independence number
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Theodore Molla, Michael Santana
-
- Colorings of oriented planar graphs avoiding a monochromatic subgraph
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Helena Bergold, Winfried Hochstättler, Raphael Steiner
-
-
( s , t ) -
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Lan Lei, Xiaoming Li, Yang Wu, Taoye Zhang, Hong-Jian Lai
-
- On extremal spectral results of digraphs based on sum distance
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Leyou Xu, Bo Zhou
-
- The multi-returning secretary problem
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): L. Bayón, P. Fortuny Ayuso, J.M. Grau, A.M. Oller-Marcén, M.M. Ruiz
-
- Going Wide with the 1-2-3 Conjecture
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille
-
- A faster algorithm for Cops and Robbers
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Jan Petr, Julien Portier, Leo Versteegen
-
- Bicritical graphs without removable edges
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: 30 October 2022Source: Discrete Applied Mathematics, Volume 320Author(s): Yipei Zhang, Xiumei Wang, Jinjiang Yuan
-
- On lengths of edge-labeled graph expressions
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 25 May 2022Source: Discrete Applied MathematicsAuthor(s): Mark Korenblit, Vadim E. Levit
-
-
( n , k ) -
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 17 May 2022Source: Discrete Applied MathematicsAuthor(s): K.S. Ajish Kumar, Birenjith Sasidharan, K.S. Sudeep
-
- Complexity results on open-independent, open-locating-dominating sets in
complementary prism graphs-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 12 May 2022Source: Discrete Applied MathematicsAuthor(s): Márcia R. Cappelle, Erika M.M. Coelho, Les R. Foulds, Humberto J. Longo
-
- Preface: CALDAM 2019
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 7 May 2022Source: Discrete Applied MathematicsAuthor(s): Sarvottamananda Swami, Sudebkumar Prasant Pal
-
- Extremal families of redundantly rigid graphs in three dimensions
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 7 April 2022Source: Discrete Applied MathematicsAuthor(s): Tibor Jordán, Christopher Poston, Ryan Roach
-
- Representation learning for temporal networks using temporal random walk
and deep autoencoder-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 11 March 2022Source: Discrete Applied MathematicsAuthor(s): Anuraj Mohan, K.V. Pramod
-
- Approximation algorithms for some Minimum Postmen Cover Problems
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 7 February 2022Source: Discrete Applied MathematicsAuthor(s): Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong
-
- Bumblebee visitation problem
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 5 February 2022Source: Discrete Applied MathematicsAuthor(s): Sandip Das, Harmender Gahlawat
-
- Minimum 2-dominating sets in regular graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 4 February 2022Source: Discrete Applied MathematicsAuthor(s): Carlos Hoppen, Giovane Mansan
-
- Structural parameterization for minimum conflict-free colouring
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 31 January 2022Source: Discrete Applied MathematicsAuthor(s): Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav
-
- Biclique graphs of split graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 26 January 2022Source: Discrete Applied MathematicsAuthor(s): M. Groshaus, A.L.P. Guedes, J.P. Puppo
-
- Computational and structural aspects of the geodetic and the hull numbers
of shadow graphs-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 25 January 2022Source: Discrete Applied MathematicsAuthor(s): Ullas Chandran S.V., Mitre C. Dourado, Maya G.S. Thankachy
-
- On subclasses of interval count two and on Fishburn’s conjecture
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 25 January 2022Source: Discrete Applied MathematicsAuthor(s): Mathew C. Francis, Lívia S. Medeiros, Fabiano S. Oliveira, Jayme L. Szwarcfiter
-
- Maximum 0-1 timed matching on temporal graphs
-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 14 January 2022Source: Discrete Applied MathematicsAuthor(s): Subhrangsu Mandal, Arobinda Gupta
-
- Convergence and correctness of belief propagation for weighted
min–max flow-
Free pre-print version: Loading...Rate this result: What is this?Please help us test our new pre-print finding feature by giving the pre-print link a rating.
A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Abstract: Publication date: Available online 13 January 2022Source: Discrete Applied MathematicsAuthor(s): Guowei Dai, Longkun Guo, Gregory Gutin, Xiaoyan Zhang, Zan-Bo Zhang
-
