Journal of Combinatorial Optimization, Volume 24 (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 > Journal of Combinatorial Optimization

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 24, Number 1, July 2012

Special Issue: ISAAC '09

• 
  • 
  • 
  • 
  • 
    Telikepalli Kavitha, Julián Mestre:
    Max-coloring paths: tight bounds and extensions. 1-14
• 
  • 
  • 
  • 
  • 
    Imran A. Pirwani:
    Shifting strategy for geometric graphs without geometry. 15-31
• 
  • 
  • 
  • 
  • 
    Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
    Minimum covering with travel cost. 32-51
• 
  • 
  • 
  • 
  • 
    Amotz Bar-Noy, Michael Lampis:
    Online maximum directed cut. 52-64

Volume 24, Number 2, August 2012

Special Issue: Fourth International Workshop on Algorithms and Computation

• 
  • 
  • 
  • 
  • 
    Satoshi Fujita, Md. Saidur Rahman:
    Introduction. 65-66
• 
  • 
  • 
  • 
  • 
    Naoki Katoh, Shin-ichi Tanigawa:
    A rooted-forest partition with uniform vertex demand. 67-98
• 
  • 
  • 
  • 
  • 
    Xiao Zhou, Takashi Hikino, Takao Nishizeki:
    Small grid drawings of planar graphs with balanced partition. 99-115
• 
  • 
  • 
  • 
  • 
    Patrizio Angelini, Fabrizio Frati:
    Acyclically 3-colorable planar graphs. 116-130
• 
  • 
  • 
  • 
  • 
    Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
    FPT algorithms for Connected Feedback Vertex Set. 131-146

Volume 24, Number 3, October 2012

• 
  • 
  • 
  • 
  • 
    Chiang Lin, Wei-Han Tsai, Jen-Ling Shang, Yuan-Jen Zhang:
    Minimum statuses of connected graphs with fixed maximum degree and order. 147-161
• 
  • 
  • 
  • 
  • 
    Jing Chen, Xinmin Hou, Ning Li:
    The total {k}-domatic number of wheels and complete graphs. 162-175
• 
  • 
  • 
  • 
  • 
    Lei Chen, Changhong Lu, Zhenbing Zeng:
    Vertices in all minimum paired-dominating sets of block graphs. 176-191
• 
  • 
  • 
  • 
  • 
    Min-Jen Jou:
    The second largest number of maximal independent sets in connected graphs with at most one cycle. 192-201
• 
  • 
  • 
  • 
  • 
    Maxim A. Babenko, Alexander V. Karzanov:
    Min-cost multiflows in node-capacitated undirected networks. 202-228
• 
  • 
  • 
  • 
  • 
    Wenchang Luo, Lin Chen, Guochuan Zhang:
    Approximation schemes for two-machine flow shop scheduling with two agents. 229-239
• 
  • 
  • 
  • 
  • 
    Jirí Fink, Petr Gregor:
    Long cycles in hypercubes with optimal number of faulty vertices. 240-265
• 
  • 
  • 
  • 
  • 
    Yuan-Zhen Huang, Chun-Ying Chiang, Liang-Hao Huang, Hong-Gwa Yeh:
    On L(2, 1)-labeling of generalized Petersen graphs. 266-279
• 
  • 
  • 
  • 
  • 
    Stefan Steinerberger:
    Random restricted matching and lower bounds for combinatorial optimization. 280-298
• 
  • 
  • 
  • 
  • 
    Min Chen, Gena Hahn, André Raspaud, Weifan Wang:
    Some results on the injective chromatic number of graphs. 299-318
• 
  • 
  • 
  • 
  • 
    Jianping Li, Weidong Li, Lusheng Wang:
    A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. 319-328
• 
  • 
  • 
  • 
  • 
    Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters:
    A Nordhaus-Gaddum-type result for the induced path number. 329-338
• 
  • 
  • 
  • 
  • 
    Michael A. Henning, Adel P. Kazemi:
    k-tuple total domination in cross products of graphs. 339-346
• 
  • 
  • 
  • 
  • 
    Hannes Moser, Rolf Niedermeier, Manuel Sorge:
    Exact combinatorial algorithms and experiments for finding maximum k-plexes. 347-373
• 
  • 
  • 
  • 
  • 
    Zaixin Lu, Wei Zhang, Weili Wu, Joonmo Kim, Bin Fu:
    The complexity of influence maximization problem in the deterministic linear threshold model. 374-378
• 
  • 
  • 
  • 
  • 
    Da Huang, Zhao Zhang:
    On cyclic vertex-connectivity of Cartesian product digraphs. 379-388
• 
  • 
  • 
  • 
  • 
    Shasha Li, Xueliang Li:
    Note on the hardness of generalized connectivity. 389-396

Volume 24, Number 4, November 2012

• 
  • 
  • 
  • 
  • 
    Julien Schleich, Le Thi Hoai An, Pascal Bouvry:
    Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA. 397-412
• 
  • 
  • 
  • 
  • 
    José Miguel Díaz-Báñez, Ruy Fabila-Monroy, David Flores-Peñaloza, Marco A. Heredia, Jorge Urrutia:
    Min-energy broadcast in mobile ad hoc networks with restricted motion. 413-426
• 
  • 
  • 
  • 
  • 
    Hsiang-Chun Hsu, Gerard J. Chang:
    Parity and strong parity edge-colorings of graphs. 427-436
• 
  • 
  • 
  • 
  • 
    Jean-Charles Créput, Amir Hajjam, Abderrafiaa Koukam, Olivier Kuhn:
    Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem. 437-458
• 
  • 
  • 
  • 
  • 
    Donatella Granata, Behnam Behdani, Panos M. Pardalos:
    On the complexity of path problems in properly colored directed graphs. 459-467
• 
  • 
  • 
  • 
  • 
    Yang Wang, Hung Q. Ngo, Thanh-Nhan Nguyen:
    Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors. 468-484
• 
  • 
  • 
  • 
  • 
    Minming Li, Qin Liu, Jianping Wang, Yingchao Zhao:
    Dispatching design for storage-centric wireless sensor networks. 485-507
• 
  • 
  • 
  • 
  • 
    Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos, Dimitris E. Simos:
    Competent genetic algorithms for weighing matrices. 508-525
• 
  • 
  • 
  • 
  • 
    Natalia Vanetik:
    On the fractionality of the path packing problem. 526-539
• 
  • 
  • 
  • 
  • 
    Gintaras Palubeckis, Dalius Rubliauskas:
    A branch-and-bound algorithm for the minimum cut linear arrangement problem. 540-563
• 
  • 
  • 
  • 
  • 
    Sheng-Long Hu, Liqun Qi:
    Algebraic connectivity of an even uniform hypergraph. 564-579
• 
  • 
  • 
  • 
  • 
    Yuehua Bu, Xubo Zhu:
    An optimal square coloring of planar graphs. 580-592
• 
  • 
  • 
  • 
  • 
    Li-ying Hou, Liying Kang:
    Online scheduling on uniform machines with two hierarchies. 593-612
• 
  • 
  • 
  • 
  • 
    Iskander Aliev, Martin Henk:
    LLL-reduction for integer knapsacks. 613-626
• 
  • 
  • 
  • 
  • 
    Yuan-Hsiang Teng, Jimmy J. M. Tan, Chey-Woei Tsay, Lih-Hsing Hsu:
    The paths embedding of the arrangement graphs with prescribed vertices in given position. 627-646

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: