Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jco/jco36.bht:"
@article{DBLP:journals/jco/Abdel-JabbarKMO18, author = {Mohammed{-}Albarra Hassan Abdel{-}Jabbar and Imed Kacem and S{\'{e}}bastien Martin and Izzeldin M. Osman}, title = {On the m-clique free interval subgraphs polytope: polyhedral analysis and applications}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {1074--1101}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0291-9}, doi = {10.1007/S10878-018-0291-9}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/Abdel-JabbarKMO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/AguedaCFLMMMNOO18, author = {Raquel {\'{A}}gueda and Nathann Cohen and Shinya Fujita and Sylvain Legay and Yannis Manoussakis and Yasuko Matsui and Leandro Montero and Reza Naserasr and Hirotaka Ono and Yota Otachi and Tadashi Sakuma and Zsolt Tuza and Renyu Xu}, title = {Safe sets in graphs: Graph classes and structural parameters}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1221--1242}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0205-2}, doi = {10.1007/S10878-017-0205-2}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/AguedaCFLMMMNOO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/AmjadiNSV18, author = {Jafar Amjadi and Sakineh Nazari{-}Moghaddam and Seyed Mahmoud Sheikholeslami and Lutz Volkmann}, title = {An upper bound on the double Roman domination number}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {81--89}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0286-6}, doi = {10.1007/S10878-018-0286-6}, timestamp = {Fri, 22 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/AmjadiNSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/AndoS18, author = {Kazutoshi Ando and Koki Sato}, title = {An algorithm for finding a representation of a subtree distance}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {742--762}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0145-x}, doi = {10.1007/S10878-017-0145-X}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/AndoS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/AuroraJR18, author = {Pawan Aurora and Monalisa Jena and Rajiv Raman}, title = {Constant factor approximation for the weighted partial degree bounded edge packing problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1243--1261}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0206-1}, doi = {10.1007/S10878-017-0206-1}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/AuroraJR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/AuroraM18, author = {Pawan Aurora and Shashank K. Mehta}, title = {The QAP-polytope and the graph isomorphism problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {965--1006}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0266-x}, doi = {10.1007/S10878-018-0266-X}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/AuroraM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Ben-AmeurGN18, author = {Walid Ben{-}Ameur and Antoine Glorieux and Jos{\'{e}} Neto}, title = {On the most imbalanced orientation of a graph}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {637--669}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0117-1}, doi = {10.1007/S10878-017-0117-1}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Ben-AmeurGN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/BendaliM18, author = {Fatiha Bendali and Jean Mailfert}, title = {The weakly connected independent set polytope in corona and join of graphs}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {1007--1023}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0275-9}, doi = {10.1007/S10878-018-0275-9}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/BendaliM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/BendottiFR18, author = {Pascale Bendotti and Pierre Fouilhoux and C{\'{e}}cile Rottner}, title = {The min-up/min-down unit commitment polytope}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {1024--1058}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0273-y}, doi = {10.1007/S10878-018-0273-Y}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/BendottiFR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/BeregCDL18, author = {Sergey Bereg and Luis Evaristo Caraballo and Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and Mario Alberto L{\'{o}}pez}, title = {Computing the k-resilience of a synchronized multi-robot system}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {365--391}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0297-3}, doi = {10.1007/S10878-018-0297-3}, timestamp = {Wed, 06 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/BeregCDL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/BougeretDG18, author = {Marin Bougeret and Guillerme Duvilli{\'{e}} and Rodolphe Giroudeau}, title = {Approximability and exact resolution of the multidimensional binary vector assignment problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {1059--1073}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0276-8}, doi = {10.1007/S10878-018-0276-8}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/BougeretDG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/BruglieriPP18, author = {Maurizio Bruglieri and Ferdinando Pezzella and Ornella Pisacane}, title = {A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {162--193}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0295-5}, doi = {10.1007/S10878-018-0295-5}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/BruglieriPP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/CaskurluWSM18, author = {Bugra {\c{C}}askurlu and Matthew D. Williamson and K. Subramani and Vahan Mkrtchyan}, title = {On approximating optimal weight "no"-certificates in weighted difference constraint systems}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {329--345}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0292-8}, doi = {10.1007/S10878-018-0292-8}, timestamp = {Fri, 09 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/CaskurluWSM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ChaiL18, author = {Xing Chai and Wenhua Li}, title = {Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {472--492}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0309-3}, doi = {10.1007/S10878-018-0309-3}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChaiL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ChangLMQ18, author = {Hong Chang and Xueliang Li and Colton Magnant and Zhongmei Qin}, title = {The (k , {\(\mathscr{l}\)})-proper index of graphs}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {458--471}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0307-5}, doi = {10.1007/S10878-018-0307-5}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChangLMQ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ChenHZ18, author = {Lina Chen and Xiaohui Huang and Zhao Zhang}, title = {A simpler {PTAS} for connected k-path vertex cover in homogeneous wireless sensor network}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {35--43}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0283-9}, doi = {10.1007/S10878-018-0283-9}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ChenHZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ConiglioKS18, author = {Stefano Coniglio and Arie M. C. A. Koster and Nils Spiekermann}, title = {Lot sizing with storage losses under demand uncertainty}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {763--788}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0147-8}, doi = {10.1007/S10878-017-0147-8}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ConiglioKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/CzibulaGZ18, author = {Oliver G. Czibula and Hanyu Gu and Yakov Zinder}, title = {Planning personnel retraining: column generation heuristics}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {896--915}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0253-2}, doi = {10.1007/S10878-018-0253-2}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/CzibulaGZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/DingQ18, author = {Wei Ding and Ke Qiu}, title = {A quadratic time exact algorithm for continuous connected 2-facility location problem in trees}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1262--1298}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0213-2}, doi = {10.1007/S10878-017-0213-2}, timestamp = {Mon, 28 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/DingQ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/DondiS18, author = {Riccardo Dondi and Florian Sikora}, title = {Finding disjoint paths on edge-colored graphs: more tractability results}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1315--1332}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0238-6}, doi = {10.1007/S10878-017-0238-6}, timestamp = {Wed, 03 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/DondiS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/EpsteinJL18, author = {Leah Epstein and David S. Johnson and Asaf Levin}, title = {Min-Sum Bin Packing}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {508--531}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0310-x}, doi = {10.1007/S10878-018-0310-X}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/EpsteinJL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/FangLSS18, author = {Qizhi Fang and Bo Li and Xiaohan Shan and Xiaoming Sun}, title = {Path cooperative games}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {211--229}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0296-4}, doi = {10.1007/S10878-018-0296-4}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/FangLSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/FeldottoLS18, author = {Matthias Feldotto and Lennart Leder and Alexander Skopalik}, title = {Congestion games with mixed objectives}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1145--1167}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0189-y}, doi = {10.1007/S10878-017-0189-Y}, timestamp = {Wed, 03 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/FeldottoLS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/FengXND18, author = {Xin Feng and Yinfeng Xu and Guanqun Ni and Yongwu Dai}, title = {Online leasing problem with price fluctuations under the consumer price index}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {493--507}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0305-7}, doi = {10.1007/S10878-018-0305-7}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/FengXND18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/FongCN18, author = {Wai Lam Fong and Wai Hong Chan and Ge Nong}, title = {The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {1--12}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0277-7}, doi = {10.1007/S10878-018-0277-7}, timestamp = {Wed, 06 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/FongCN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/GaiDWZB18, author = {Ling Gai and Hongwei Du and Lidong Wu and Junlei Zhu and Yuehua Bu}, title = {Blocking Rumor by Cut}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {392--399}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0304-8}, doi = {10.1007/S10878-018-0304-8}, timestamp = {Thu, 01 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/GaiDWZB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/GottschalkLPW18, author = {Corinna Gottschalk and Hendrik L{\"{u}}then and Britta Peis and Andreas Wierz}, title = {Optimization problems with color-induced budget constraints}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {861--870}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0182-5}, doi = {10.1007/S10878-017-0182-5}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/GottschalkLPW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/GourvesMT18, author = {Laurent Gourv{\`{e}}s and J{\'{e}}r{\^{o}}me Monnot and Lydia Tlilane}, title = {Subset sum problems with digraph constraints}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {937--964}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0262-1}, doi = {10.1007/S10878-018-0262-1}, timestamp = {Tue, 04 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/GourvesMT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/GregorSV18, author = {Petr Gregor and Riste Skrekovski and Vida Vukasinovic}, title = {Broadcasting multiple messages in the 1-in port model in optimal time}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1333--1355}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0274-x}, doi = {10.1007/S10878-018-0274-X}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/GregorSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/GuGLZ18, author = {Jinwei Gu and Manzhan Gu and Xiwen Lu and Ying Zhang}, title = {Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {142--161}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0294-6}, doi = {10.1007/S10878-018-0294-6}, timestamp = {Wed, 06 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/GuGLZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HanLLM18, author = {Miaomiao Han and You Lu and Rong Luo and Zhengke Miao}, title = {Neighbor sum distinguishing total coloring of graphs with bounded treewidth}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {23--34}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0271-0}, doi = {10.1007/S10878-018-0271-0}, timestamp = {Fri, 04 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/HanLLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HanawaHKKT18, author = {Yosuke Hanawa and Yuya Higashikawa and Naoyuki Kamiyama and Naoki Katoh and Atsushi Takizawa}, title = {The mixed evacuation problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1299--1314}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0237-7}, doi = {10.1007/S10878-017-0237-7}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/HanawaHKKT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HarksT18, author = {Tobias Harks and Veerle Timmermans}, title = {Uniqueness of equilibria in atomic splittable polymatroid congestion games}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {812--830}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0166-5}, doi = {10.1007/S10878-017-0166-5}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/HarksT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HaynesH18, author = {Teresa W. Haynes and Michael A. Henning}, title = {Perfect graphs involving semitotal and semipaired domination}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {416--433}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0303-9}, doi = {10.1007/S10878-018-0303-9}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/HaynesH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HellmuthW18, author = {Marc Hellmuth and Nicolas Wieseke}, title = {On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {591--616}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0111-7}, doi = {10.1007/S10878-017-0111-7}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/HellmuthW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HiraiO18, author = {Hiroshi Hirai and Taihei Oki}, title = {A compact representation for minimizers of k-submodular functions}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {709--741}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0142-0}, doi = {10.1007/S10878-017-0142-0}, timestamp = {Fri, 01 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/HiraiO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HoskinsLVY18, author = {Heather Hoskins and Runrun Liu and Jennifer Vandenbussche and Gexin Yu}, title = {Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {346--364}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0298-2}, doi = {10.1007/S10878-018-0298-2}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/HoskinsLVY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/HuangLW18, author = {Jing Huang and Shuchao Li and Hua Wang}, title = {Relation between the skew-rank of an oriented graph and the independence number of its underlying graph}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {65--80}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0282-x}, doi = {10.1007/S10878-018-0282-X}, timestamp = {Fri, 27 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/HuangLW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Iwamasa18, author = {Yuni Iwamasa}, title = {On a general framework for network representability in discrete optimization}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {678--708}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0136-y}, doi = {10.1007/S10878-017-0136-Y}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Iwamasa18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/KamgaWWC18, author = {Victor Loumngam Kamga and Weifan Wang and Ying Wang and Min Chen}, title = {2-Distance vertex-distinguishing index of subcubic graphs}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {108--120}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0288-4}, doi = {10.1007/S10878-018-0288-4}, timestamp = {Tue, 28 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/KamgaWWC18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/KangZS18, author = {Liying Kang and Jianjie Zhou and Erfang Shan}, title = {Algorithms for connected p-centdian problem on block graphs}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {252--263}, year = {2018}, url = {https://doi.org/10.1007/s10878-016-0058-0}, doi = {10.1007/S10878-016-0058-0}, timestamp = {Wed, 06 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/KangZS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Kiraly18, author = {Tam{\'{a}}s Kir{\'{a}}ly}, title = {Base polyhedra and the linking property}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {671--677}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0133-1}, doi = {10.1007/S10878-017-0133-1}, timestamp = {Thu, 13 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Kiraly18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/KonigMHR18, author = {J{\"{u}}rgen K{\"{o}}nig and Alexander M{\"{a}}cker and Friedhelm Meyer auf der Heide and S{\"{o}}ren Riechers}, title = {Scheduling with interjob communication on parallel processors}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1356--1379}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0325-3}, doi = {10.1007/S10878-018-0325-3}, timestamp = {Tue, 02 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/KonigMHR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/KurpiszLM18, author = {Adam Kurpisz and Samuli Lepp{\"{a}}nen and Monaldo Mastrolilli}, title = {Sum-of-squares rank upper bounds for matching problems}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {831--844}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0169-2}, doi = {10.1007/S10878-017-0169-2}, timestamp = {Sun, 06 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/KurpiszLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/LeP18, author = {Van Bang Le and Sheng{-}Lung Peng}, title = {On the complete width and edge clique cover problems}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {532--548}, year = {2018}, url = {https://doi.org/10.1007/s10878-016-0106-9}, doi = {10.1007/S10878-016-0106-9}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/LeP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/LuoXZZ18, author = {Kelin Luo and Yinfeng Xu and Bowen Zhang and Huili Zhang}, title = {Creating an acceptable consensus ranking for group decision making}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {307--328}, year = {2018}, url = {https://doi.org/10.1007/s10878-016-0086-9}, doi = {10.1007/S10878-016-0086-9}, timestamp = {Thu, 03 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/LuoXZZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/LuzarPS18a, author = {Borut Luzar and Jakub Przybylo and Roman Sot{\'{a}}k}, title = {New bounds for locally irregular chromatic index of bipartite and subcubic graphs}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1425--1438}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0313-7}, doi = {10.1007/S10878-018-0313-7}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/LuzarPS18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/MackerMHR18, author = {Alexander M{\"{a}}cker and Manuel Malatyali and Friedhelm Meyer auf der Heide and S{\"{o}}ren Riechers}, title = {Cost-efficient scheduling on machines from the cloud}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1168--1194}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0198-x}, doi = {10.1007/S10878-017-0198-X}, timestamp = {Tue, 02 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/MackerMHR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Mallach18, author = {Sven Mallach}, title = {Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {871--895}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0199-9}, doi = {10.1007/S10878-017-0199-9}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Mallach18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Martinez-PerezR18, author = {{\'{A}}lvaro Mart{\'{\i}}nez{-}P{\'{e}}rez and Jos{\'{e}} M. Rodr{\'{\i}}guez}, title = {New lower bounds for the second variable Zagreb index}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {194--210}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0293-7}, doi = {10.1007/S10878-018-0293-7}, timestamp = {Sun, 02 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Martinez-PerezR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/MeiYZ18, author = {Lili Mei and Deshi Ye and Yong Zhang}, title = {Approximation strategy-proof mechanisms for obnoxious facility location on a line}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {549--571}, year = {2018}, url = {https://doi.org/10.1007/s10878-016-0105-x}, doi = {10.1007/S10878-016-0105-X}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/MeiYZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/MerabetMD18, author = {Massinissa Merabet and Mikl{\'{o}}s Moln{\'{a}}r and Sylvain Durand}, title = {{ILP} formulation of the degree-constrained minimum spanning hierarchy problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {789--811}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0159-4}, doi = {10.1007/S10878-017-0159-4}, timestamp = {Tue, 04 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/MerabetMD18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/MishraMP18, author = {Gopinath Mishra and Subhra Mazumdar and Arindam Pal}, title = {Improved algorithms for the evacuation route planning problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {280--306}, year = {2018}, url = {https://doi.org/10.1007/s10878-016-0082-0}, doi = {10.1007/S10878-016-0082-0}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/MishraMP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Oboudi18, author = {Mohammad Reza Oboudi}, title = {Majorization and the spectral radius of starlike trees}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {121--129}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0287-5}, doi = {10.1007/S10878-018-0287-5}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Oboudi18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Oboudi18a, author = {Mohammad Reza Oboudi}, title = {Correction to: Majorization and the spectral radius of starlike trees}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {130}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0301-y}, doi = {10.1007/S10878-018-0301-Y}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Oboudi18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/PanXZ18, author = {Jiayin Pan and Yinfeng Xu and Guiqing Zhang}, title = {Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {617--636}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0113-5}, doi = {10.1007/S10878-017-0113-5}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/PanXZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/PandaPP18, author = {B. S. Panda and Arti Pandey and Subhabrata Paul}, title = {Algorithmic aspects of b-disjunctive domination in graphs}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {572--590}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0112-6}, doi = {10.1007/S10878-017-0112-6}, timestamp = {Tue, 25 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/PandaPP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/PedrosaS18, author = {Lehilton L. C. Pedrosa and Rafael Crivellari Saliba Schouery}, title = {Approximation algorithms for the bus evacuation problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {131--141}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0290-x}, doi = {10.1007/S10878-018-0290-X}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/PedrosaS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/Pinar18, author = {Mustafa {\c{C}}. Pinar}, title = {Robust trading mechanisms over 0/1 polytopes}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {845--860}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0177-2}, doi = {10.1007/S10878-017-0177-2}, timestamp = {Tue, 04 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/Pinar18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/PisantechakoolT18, author = {Photchchara Pisantechakool and Xuehou Tan}, title = {The capture time of a planar graph}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1103--1117}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0173-6}, doi = {10.1007/S10878-017-0173-6}, timestamp = {Wed, 03 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/PisantechakoolT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/QueyranneW18, author = {Maurice Queyranne and Laurence A. Wolsey}, title = {Optimum turn-restricted paths, nested compatibility, and optimum convex polygons}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {90--107}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0281-y}, doi = {10.1007/S10878-018-0281-Y}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/QueyranneW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/RecaldeSTV18, author = {Diego Recalde and Daniel Sever{\'{\i}}n and Ramiro Torres and Polo Vaca}, title = {An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment}, journal = {J. Comb. Optim.}, volume = {36}, number = {3}, pages = {916--936}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0254-1}, doi = {10.1007/S10878-018-0254-1}, timestamp = {Thu, 24 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/RecaldeSTV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ShanK18, author = {Erfang Shan and Liying Kang}, title = {The w-centroids and least w-central subtrees in weighted trees}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1118--1127}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0174-5}, doi = {10.1007/S10878-017-0174-5}, timestamp = {Tue, 02 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ShanK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/WangLGDW18, author = {Huijuan Wang and Bin Liu and Ling Gai and Hongwei Du and Jianliang Wu}, title = {Minimum choosability of planar graphs}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {13--22}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0280-z}, doi = {10.1007/S10878-018-0280-Z}, timestamp = {Thu, 01 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/WangLGDW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/WangXDW18, author = {Yishui Wang and Dachuan Xu and Donglei Du and Chenchen Wu}, title = {An approximation algorithm for k-facility location problem with linear penalties using local search scheme}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {264--279}, year = {2018}, url = {https://doi.org/10.1007/s10878-016-0080-2}, doi = {10.1007/S10878-016-0080-2}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/WangXDW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/WellerCGKP18, author = {Mathias Weller and Annie Chateau and Rodolphe Giroudeau and Jean{-}Claude K{\"{o}}nig and Valentin Pollet}, title = {On residual approximation in solution extension problems}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1195--1220}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0202-5}, doi = {10.1007/S10878-017-0202-5}, timestamp = {Wed, 03 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/WellerCGKP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/WuC18, author = {Yueshi Wu and Mihaela Cardei}, title = {Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {230--251}, year = {2018}, url = {https://doi.org/10.1007/s10878-016-0055-3}, doi = {10.1007/S10878-016-0055-3}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/WuC18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/XieG18, author = {Tian Xie and Dongdong Ge}, title = {A tractable discrete fractional programming: application to constrained assortment optimization}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {400--415}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0302-x}, doi = {10.1007/S10878-018-0302-X}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/XieG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/XuLDK18, author = {Kexiang Xu and Haiqiong Liu and Kinkar Chandra Das and Sandi Klavzar}, title = {Embeddings into almost self-centered graphs of given radius}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1388--1410}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0311-9}, doi = {10.1007/S10878-018-0311-9}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/XuLDK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/XuPX18, author = {Yi Xu and Jigen Peng and Yinfeng Xu}, title = {The mixed center location problem}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1128--1144}, year = {2018}, url = {https://doi.org/10.1007/s10878-017-0183-4}, doi = {10.1007/S10878-017-0183-4}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/XuPX18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ZhangCQ18, author = {Guiqing Zhang and Yongxi Cheng and Lan Qin}, title = {An improved online evacuation strategy from a convex region on grid networks}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {44--54}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0284-8}, doi = {10.1007/S10878-018-0284-8}, timestamp = {Tue, 10 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ZhangCQ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ZhangFLLZL18, author = {Xiao Zhang and Haosheng Fan and Victor C. S. Lee and Minming Li and Yingchao Zhao and Chuang Liu}, title = {Minimizing the total cost of barrier coverage in a linear domain}, journal = {J. Comb. Optim.}, volume = {36}, number = {2}, pages = {434--457}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0306-6}, doi = {10.1007/S10878-018-0306-6}, timestamp = {Sun, 26 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/ZhangFLLZL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ZhongB18, author = {Liwei Zhong and Yanqin Bai}, title = {Equivalence of two-sided stable matching}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1380--1387}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0308-4}, doi = {10.1007/S10878-018-0308-4}, timestamp = {Tue, 02 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ZhongB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ZhuB18, author = {Junlei Zhu and Yuehua Bu}, title = {Minimum 2-distance coloring of planar graphs and channel assignment}, journal = {J. Comb. Optim.}, volume = {36}, number = {1}, pages = {55--64}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0285-7}, doi = {10.1007/S10878-018-0285-7}, timestamp = {Wed, 06 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ZhuB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/ZhuGSL18, author = {Haiyang Zhu and Yu Gu and Jingjun Sheng and Xinzhong L{\"{u}}}, title = {List 2-distance {\textdollar}{\textdollar}{\textbackslash}varDelta +3{\textdollar}{\textdollar} {\(\Delta\)} + 3 -coloring of planar graphs without 4, 5-cycles}, journal = {J. Comb. Optim.}, volume = {36}, number = {4}, pages = {1411--1424}, year = {2018}, url = {https://doi.org/10.1007/s10878-018-0312-8}, doi = {10.1007/S10878-018-0312-8}, timestamp = {Tue, 02 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/ZhuGSL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.