default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 270
Volume 270, November 2019
- Nurdagül Anbar
, Wilfried Meidl, Alexander Pott:
Equivalence for negabent functions and their relative difference sets. 1-12 - Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena:
Edge weights and vertex colours: Minimizing sum count. 13-24 - Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: Complexity and approximation. 25-36 - Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric:
How long does it take for all users in a social network to choose their communities? 37-57 - Andreas Brandstädt, Raffaele Mosca:
On efficient domination for some classes of H-free bipartite graphs. 58-67 - Haiyan Chen, Bojan Mohar:
The sandpile group of a polygon flower. 68-82 - Yongxi Cheng, Yunyue Yang, Ding-Zhu Du:
A class of asymptotically optimal group screening strategies with limited item participation. 83-95 - Gi-Sang Cheon, Jinha Kim, Minki Kim, Sergey Kitaev:
Word-representability of Toeplitz graphs. 96-105 - Peter Dankelmann, Fadekemi Janet Osaye, Simon Mukwembi, Bernardo Gabriel Rodrigues:
Upper bounds on the average eccentricity of K3-free and C4-free graphs. 106-114 - Keith J. Edwards, Steven D. Noble:
The complexity of solution-free sets of integers for general linear equations. 115-133 - Shishuo Fu, Ting Hua, Vincent Vajnovszki:
Mahonian STAT on rearrangement class of words. 134-141 - Ferdinand Ihringer, Andrey Kupavskii:
Regular intersecting families. 142-152 - Faisal Javaid, Muhammad Kamran Jamil, Ioan Tomescu:
Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices. 153-158 - Rana Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two. 159-167 - Gilad Kutiel, Dror Rawitz:
Service chain placement in SDNs. 168-180 - Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang:
Fractional matching preclusion for arrangement graphs. 181-189 - Tatsuya Matsuoka, Zoltán Szigeti:
Polymatroid-based capacitated packing of branchings. 190-203
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-01 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
