default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 283
Volume 283, September 2020
- Noam Goldberg, Gábor Rudolf:
On the complexity and approximation of the maximum expected value all-or-nothing subset. 1-10 - Sergey I. Veselov
, Dmitry V. Gribanov, Nikolai Yu. Zolotykh, Aleksandr Yu. Chirkov:
A polynomial algorithm for minimizing discrete convic functions in fixed dimension. 11-19 - Bas J. Dietzenbacher, Peter Borm, Ruud Hendrickx:
A procedural egalitarian solution for NTU-games. 20-27 - Katarzyna Zajac:
On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs. 28-43 - Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. 44-58 - Andreas Bärmann, Patrick Gemander, Maximilian Merkert:
The clique problem with multiple-choice constraints under a cycle-free dependency graph. 59-77 - Iain A. Stewart:
Using semidirect products of groups to build classes of interconnection networks. 78-97 - Mareike Fischer, Andrew R. Francis:
How tree-based is my network? Proximity measures for unrooted phylogenetic networks. 98-114 - Kathryn L. Nyman, Francis Edward Su, Shira Zerbib:
Fair division with multiple pieces. 115-122 - Vaibhav Karve, Anil N. Hirani:
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs. 123-132 - Robert A. Beeler, Teresa W. Haynes, Michael A. Henning, Rodney Keaton:
Total domination cover rubbling. 133-141 - Marina Moscarini:
On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent. 142-152 - Luiz Emilio Allem, Fernando Tura:
Integral cographs. 153-167 - Rommel M. Barbosa, Mitre Costa Dourado, Leila Roling Scariot da Silva:
Global defensive alliances in the lexicographic product of paths and cycles. 168-188 - David Tankus:
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7. 189-198 - Soogang Eoh, Suh-Ryung Kim, Hyesun Yoon:
On m-step competition graphs of bipartite tournaments. 199-206 - Alireza Mofidi:
On partial cubes, well-graded families and their duals with some applications in graphs. 207-230 - Hongbo Hua, Xinying Hua, Hongzhuan Wang:
Further results on the Merrifield-Simmons index. 231-241 - Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A model for finding transition-minors. 242-264 - Yoshimi Egawa, Mikio Kano, Maho Yokota:
Existence of all generalized fractional (g, f)-factors of graphs. 265-271 - Yuanrui Feng, Douglas B. West, Yan Yang:
Upper bounds for bar visibility of subgraphs and n-vertex graphs. 272-274 - Wanshun Yang, Weifan Wang, Yiqiao Wang:
An improved upper bound for the acyclic chromatic number of 1-planar graphs. 275-291 - Naoki Matsumoto, Atsuhiro Nakamoto, Seiya Negami:
Diagonal flips in plane graphs with triangular and quadrangular faces. 292-305 - Peter Borg, Pawaton Kaemawichanurat:
Partial domination of maximal outerplanar graphs. 306-314 - Yansheng Wu, Jong Yoon Hyun:
Few-weight codes over Fp+uFp associated with down sets and their distance optimal Gray image. 315-322 - Hyang-Sook Lee, Seongan Lim, Kyunghwan Song, Ikkwon Yie:
New orthogonality criterion for shortest vector of lattices and its applications. 323-335 - Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. 336-345 - Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann:
Sparse recovery with integrality constraints. 346-366 - Constanza Riera, Pantelimon Stanica, Sugata Gangopadhyay:
Generalized bent Boolean functions and strongly regular Cayley graphs. 367-374 - Sabrina Bouchouika, Isma Bouchemakh, Éric Sopena:
Broadcasts on paths and cycles. 375-395 - Frank Sommer, Christian Komusiewicz:
Parameterized algorithms for Module Map problems. 396-416 - Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. 417-434 - Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez:
Characterising circular-arc contact B0-VPG graphs. 435-443 - Peng Xiao, Li-Gong Wang:
The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge. 444-455 - Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Constant work-space algorithms for facility location problems. 456-472 - Jinfeng Liu, Fei Huang, Stephan Wagner:
Matchings in graphs with a given number of cuts. 473-481 - Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev:
Letter graphs and geometric grid classes of permutations: Characterization and recognition. 482-494 - Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees. 495-511 - Xiaojing Jiang, Weihua He, Qiang Liu, Jianping Li:
On the Kirchhoff index of bipartite graphs with given diameters. 512-521 - Ran Gu, Xueliang Li:
Conflict-free connection number of random graphs. 522-532 - Wei Zhuang:
Connected domination in maximal outerplanar graphs. 533-541 - Jun Ge, Fengming Dong:
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. 542-554 - Doost Ali Mojdeh, Lutz Volkmann:
Roman {3}-domination (double Italian domination). 555-564 - Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. 565-576 - Lifang Zhao, Heping Zhang:
On the anti-Kekulé number of (4, 5, 6)-fullerenes. 577-589 - Ruonan Li, Binlong Li, Shenggui Zhang:
A classification of edge-colored graphs based on properly colored walks. 590-595 - Sergey Bereg, Mohammadreza Haghpanah:
New lower bounds for Tverberg partitions with tolerance in the plane. 596-603 - Avinash Patil, A. S. Khairnar, B. N. Waphare:
Zero-divisor graph of a poset with respect to an automorphism. 604-612 - Ho-Hon Leung, Thotsaporn "Aek" Thanatipanonda:
Game of pure chance with restricted boundary. 613-625 - Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu:
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. 626-630 - Chunlei Zu:
A note on partitions of graphs under degree constraints. 631-633 - Roberto Cruz, Juan Monsalve, Juan Rada:
Trees with maximum exponential Randić index. 634-643 - Andreas D. M. Gunawan, Rathin Jeyaram, Louxin Zhang:
Counting and enumerating galled networks. 644-654 - Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
On the structure of 4-regular planar well-covered graphs. 655-688 - Christopher Hojny:
Packing, partitioning, and covering symresacks. 689-717
- Koki Takayama, Yusuke Kobayashi:
On the number of edges in a graph with many two-hop disjoint paths. 718-723 - Andrei M. Raigorodskii, Mikhail M. Koshelev:
New bounds on clique-chromatic numbers of Johnson graphs. 724-729 - Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang:
Comments on "A Hamilton sufficient condition for completely independent spanning tree". 730-733 - Aaron Krim-Yee, Ben Seamone, Virgélot Virgile:
Eternal domination on prisms of graphs. 734-736 - Yanan Zhang, Haiyan Chen:
The average Laplacian polynomial of a graph. 737-743 - Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A connected version of the graph coloring game. 744-750 - Chunhui Lai:
On the number of edges in some graphs. 751-755 - Matjaz Krnc, Robin J. Wilson:
Recognizing generalized Petersen graphs in linear time. 756-761 - Ben Amiet, Greg Markowsky, José Luis Palacios:
On the equivalence of cylinder tilings and planar electric networks. 762-769
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 2026-09-01 03:25 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
