Discrete Applied Mathematics, Volume 216 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Discrete Applied Mathematics

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volumes 216, Part 1, January 2017

• 
  • 
  • 
  • 
  • 
    Feodor F. Dragan, Dieter Kratsch, Van Bang Le:
    Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. 1
• 
  • 
  • 
  • 
  • 
    Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
    Threshold-coloring and unit-cube contact representation of planar graphs. 2-14
• 
  • 
  • 
  • 
  • 
    Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich:
    Graphs with maximal induced matchings of the same size. 15-28
• 
  • 
  • 
  • 
  • 
    Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok:
    Characterizing width two for variants of treewidth. 29-46
• 
  • 
  • 
  • 
  • 
    Endre Boros, Vladimir Gurvich, Martin Milanic:
    On equistable, split, CIS, and related classes of graphs. 47-66
• 
  • 
  • 
  • 
  • 
    Yixin Cao, Luciano N. Grippo, Martín Darío Safe:
    Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection. 67-83
• 
  • 
  • 
  • 
  • 
    Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
    Max point-tolerance graphs. 84-97
• 
  • 
  • 
  • 
  • 
    L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar:
    Rainbow colouring of split graphs. 98-113
• 
  • 
  • 
  • 
  • 
    Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
    Treewidth and Pathwidth parameterized by the vertex cover number. 114-129
• 
  • 
  • 
  • 
  • 
    Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
    Ferrers dimension of grid intersection graphs. 130-135
• 
  • 
  • 
  • 
  • 
    Andrew Collins, Sergey Kitaev, Vadim V. Lozin:
    New results on word-representable graphs. 136-141
• 
  • 
  • 
  • 
  • 
    Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait:
    On color-critical (P5, co-P5)-free graphs. 142-148
• 
  • 
  • 
  • 
  • 
    Jérémie Dusart, Michel Habib:
    A new LBFS-based algorithm for cocomparability graph recognition. 149-161
• 
  • 
  • 
  • 
  • 
    Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
    Minimal dominating sets in interval graphs and trees. 162-170
• 
  • 
  • 
  • 
  • 
    Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
    On recognition of threshold tolerance graphs and their complements. 171-180
• 
  • 
  • 
  • 
  • 
    Petr A. Golovach, Daniël Paulusma, Iain A. Stewart:
    Graph editing to a fixed target. 181-190
• 
  • 
  • 
  • 
  • 
    Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter:
    On neighborhood-Helly graphs. 191-202
• 
  • 
  • 
  • 
  • 
    Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki:
    Thin strip graphs. 203-210
• 
  • 
  • 
  • 
  • 
    Pavol Hell, Shenwei Huang:
    Complexity of coloring graphs without paths and cycles. 211-232
• 
  • 
  • 
  • 
  • 
    T. Karthick, Frédéric Maffray:
    Maximum weight independent sets in classes related to claw-free graphs. 233-239
• 
  • 
  • 
  • 
  • 
    Stefan Kratsch, Pascal Schweitzer:
    Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. 240-253
• 
  • 
  • 
  • 
  • 
    Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey:
    Reconstructing trees from digitally convex sets. 254-260
• 
  • 
  • 
  • 
  • 
    Van Bang Le, Thomas Podelleck:
    Characterization and recognition of some opposition and coalition graph classes. 261-272
• 
  • 
  • 
  • 
  • 
    Vadim V. Lozin, Dmitriy S. Malyshev:
    Vertex coloring of graphs with few obstructions. 273-280
• 
  • 
  • 
  • 
  • 
    Raffaele Mosca:
    A sufficient condition to extend polynomial results for the Maximum Independent Set Problem. 281-289
• 
  • 
  • 
  • 
  • 
    B. S. Panda, Arti Pandey:
    Algorithmic aspects of open neighborhood location-domination in graphs. 290-306
• 
  • 
  • 
  • 
  • 
    Bino Sebastian V., A. Unnikrishnan, Kannan Balakrishnan, Ramkumar Padinjare Pisharath Balakrishna:
    Morphological filtering on hypergraphs. 307-320

Volumes 216, Part 2, January 2017

• 
  • 
  • 
  • 
  • 
    Valentin E. Brimkov, Reneta P. Barneva:
    Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences. 321-322
• 
  • 
  • 
  • 
  • 
    Josef Slapal:
    Alexandroff pretopologies for structuring the digital plane. 323-334
• 
  • 
  • 
  • 
  • 
    Sang-Eon Han, Wei Yao:
    An MA-digitization of Hausdorff spaces by using a connectedness graph of the Marcus-Wyse topology. 335-347
• 
  • 
  • 
  • 
  • 
    Kálmán Palágyi, Gábor Németh:
    A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms. 348-361
• 
  • 
  • 
  • 
  • 
    Ranita Biswas, Partha Bhowmick, Valentin E. Brimkov:
    On the polyhedra of graceful spheres and circular geodesics. 362-375
• 
  • 
  • 
  • 
  • 
    Tetsuo Asano, Lilian Buzer, Sergey Bereg:
    A new algorithmic framework for basic problems on binary images. 376-392
• 
  • 
  • 
  • 
  • 
    Boris Brimkov, Illya V. Hicks:
    Memory efficient algorithms for cactus graphs and block graphs. 393-407
• 
  • 
  • 
  • 
  • 
    Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Partha Bhowmick, Bhargab B. Bhattacharya:
    A linear-time algorithm to compute the triangular hull of a digital object. 408-423
• 
  • 
  • 
  • 
  • 
    Benedek Nagy:
    Application of neighborhood sequences in communication of hexagonal networks. 424-440
• 
  • 
  • 
  • 
  • 
    Péter Kardos, Kálmán Palágyi:
    On topology preservation of mixed operators in triangular, square, and hexagonal grids. 441-448
• 
  • 
  • 
  • 
  • 
    Filip Malmberg, Cris L. Luengo Hendriks, Robin Strand:
    Exact evaluation of targeted stochastic watershed cuts. 449-460
• 
  • 
  • 
  • 
  • 
    Phuc Ngo, Yukiko Kenmochi, Akihiro Sugimoto, Hugues Talbot, Nicolas Passat:
    Discrete rigid registration: A local graph-search approach. 461-481

Volumes 216, Part 3, January 2017

• 
  • 
  • 
  • 
  • 
    Zoltán Füredi, Gyula O. H. Katona:
    Preface: Levon Khachatrian's legacy in extremal combinatorics. 483-488
• 
  • 
  • 
  • 
  • 
    Antonio Acín, Runyao Duan, David E. Roberson, Ana Belén Sainz, Andreas J. Winter:
    A new property of the Lovász number and duality relations between graph parameters. 489-501
• 
  • 
  • 
  • 
  • 
    Levon Aslanyan, Hasmik Sahakyan:
    The splitting technique in monotone recognition. 502-512
• 
  • 
  • 
  • 
  • 
    Harout K. Aydinian:
    A subspace covering problem in the n-cube. 513-517
• 
  • 
  • 
  • 
  • 
    Leonid A. Bassalygo, Victor A. Zinoviev:
    On Kloosterman sums over finite fields of characteristic 3. 518-523
• 
  • 
  • 
  • 
  • 
    Christian Bey:
    An intersection theorem for systems of finite sets. 524-528
• 
  • 
  • 
  • 
  • 
    Eddie Cheng, Ke Qiu, Zhizhang Shen:
    A strong connectivity property of the generalized exchanged hypercube. 529-536
• 
  • 
  • 
  • 
  • 
    Samvel Kh. Darbinyan, Iskandar A. Karapetyan:
    On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li. 537-549
• 
  • 
  • 
  • 
  • 
    Guillaume Fertin, Joseph G. Peters, Lynette Raabe, Charlie Xu:
    Odd gossiping. 550-561
• 
  • 
  • 
  • 
  • 
    Peter Frankl:
    On the maximum number of edges in a hypergraph with given matching number. 562-581
• 
  • 
  • 
  • 
  • 
    Zoltán Füredi, Lale Özkahya:
    On 3-uniform hypergraphs without a cycle of a given length. 582-588
• 
  • 
  • 
  • 
  • 
    Katalin Gyarmati, Christian Mauduit, András Sárközy:
    On finite pseudorandom binary lattices. 589-597
• 
  • 
  • 
  • 
  • 
    Hovhannes A. Harutyunyan, Shahin Kamali:
    Efficient broadcast trees for weighted vertices. 598-608
• 
  • 
  • 
  • 
  • 
    Pavol Hell, César Hernández-Cruz:
    Strict chordal and strict split digraphs. 609-617
• 
  • 
  • 
  • 
  • 
    Gyula O. H. Katona:
    Around the Complete Intersection Theorem. 618-621
• 
  • 
  • 
  • 
  • 
    Gurgen H. Khachatrian, Melsik Kyureghyan:
    Permutation polynomials and a new public-key encryption. 622-626
• 
  • 
  • 
  • 
  • 
    Sangjune Lee, Mark H. Siggers, Norihide Tokushige:
    Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families. 627-645
• 
  • 
  • 
  • 
  • 
    Arthur L. Liestman, Dana Richards:
    Minimum multiple originator broadcast graphs. 646-661
• 
  • 
  • 
  • 
  • 
    Melvyn B. Nathanson:
    Free monoids and forests of rational numbers. 662-669
• 
  • 
  • 
  • 
  • 
    András Sárközy:
    On pseudorandomness of families of binary sequences. 670-676

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: