Search dblp for Publications

• > Home > Search

@article{DBLP:journals/jota/BartaM22,
  author       = {J{\'{a}}nos Barta and
                  Roberto Montemanni},
  title        = {The Maximum Clique Problem for Permutation Hamming Graphs},
  journal      = {J. Optim. Theory Appl.},
  volume       = {194},
  number       = {2},
  pages        = {492--507},
  year         = {2022},
  url          = {https://doi.org/10.1007/s10957-022-02035-w},
  doi          = {10.1007/S10957-022-02035-W},
  timestamp    = {Thu, 25 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jota/BartaM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/air/RautP20,
  author       = {Sreenanda Raut and
                  Madhumangal Pal},
  title        = {Generation of maximal fuzzy cliques of fuzzy permutation graph and
                  applications},
  journal      = {Artif. Intell. Rev.},
  volume       = {53},
  number       = {3},
  pages        = {1585--1614},
  year         = {2020},
  url          = {https://doi.org/10.1007/s10462-019-09714-7},
  doi          = {10.1007/S10462-019-09714-7},
  timestamp    = {Thu, 19 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/air/RautP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/AtminasBKLV15,
  author       = {Aistis Atminas and
                  Robert Brignall and
                  Nicholas Korpelainen and
                  Vadim V. Lozin and
                  Vincent Vatter},
  title        = {Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique},
  journal      = {Electron. J. Comb.},
  volume       = {22},
  number       = {2},
  pages        = {2},
  year         = {2015},
  url          = {https://doi.org/10.37236/4074},
  doi          = {10.37236/4074},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/AtminasBKLV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ol/CacchianiCT13,
  author       = {Valentina Cacchiani and
                  Alberto Caprara and
                  Paolo Toth},
  title        = {Finding cliques of maximum weight on a generalization of permutation
                  graphs},
  journal      = {Optim. Lett.},
  volume       = {7},
  number       = {2},
  pages        = {289--296},
  year         = {2013},
  url          = {https://doi.org/10.1007/s11590-011-0416-x},
  doi          = {10.1007/S11590-011-0416-X},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ol/CacchianiCT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cpm/Tiskin06,
  author       = {Alexandre Tiskin},
  editor       = {Moshe Lewenstein and
                  Gabriel Valiente},
  title        = {Longest Common Subsequences in Permutations and Maximum Cliques in
                  Circle Graphs},
  booktitle    = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006,
                  Barcelona, Spain, July 5-7, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4009},
  pages        = {270--281},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11780441\_25},
  doi          = {10.1007/11780441\_25},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/Tiskin06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/BrandstadtL03,
  author       = {Andreas Brandst{\"{a}}dt and
                  Vadim V. Lozin},
  title        = {On the linear structure and clique-width of bipartite permutation
                  graphs},
  journal      = {Ars Comb.},
  volume       = {67},
  year         = {2003},
  timestamp    = {Tue, 02 Dec 2003 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/BrandstadtL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BondyDLS03,
  author       = {J. Adrian Bondy and
                  Guillermo Dur{\'{a}}n and
                  Min Chih Lin and
                  Jayme Luiz Szwarcfiter},
  title        = {Self-clique graphs and matrix permutations},
  journal      = {J. Graph Theory},
  volume       = {44},
  number       = {3},
  pages        = {178--192},
  year         = {2003},
  url          = {https://doi.org/10.1002/jgt.10496},
  doi          = {10.1002/JGT.10496},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BondyDLS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/gecco/MatsuiT00,
  author       = {Shouichi Matsui and
                  Ken{-}ichi Tokoro},
  editor       = {L. Darrell Whitley and
                  David E. Goldberg and
                  Erick Cant{\'{u}}{-}Paz and
                  Lee Spector and
                  Ian C. Parmee and
                  Hans{-}Georg Beyer},
  title        = {A New Genetic Algorithm for Minimum Span Frequency Assignment using
                  Permutation and Clique},
  booktitle    = {Proceedings of the Genetic and Evolutionary Computation Conference
                  {(GECCO} '00), Las Vegas, Nevada, USA, July 8-12, 2000},
  pages        = {682--689},
  publisher    = {Morgan Kaufmann},
  year         = {2000},
  timestamp    = {Wed, 21 Jul 2004 09:29:17 +0200},
  biburl       = {https://dblp.org/rec/conf/gecco/MatsuiT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/ChangW92,
  author       = {Maw{-}Shang Chang and
                  Fu{-}Hsing Wang},
  title        = {Efficient Algorithms for the Maximum Weight Clique and Maximum Weight
                  Independent Set Problems on Permutation Graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {43},
  number       = {6},
  pages        = {293--295},
  year         = {1992},
  url          = {https://doi.org/10.1016/0020-0190(92)90114-B},
  doi          = {10.1016/0020-0190(92)90114-B},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/ChangW92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SrinivasanR91,
  author       = {Aravind Srinivasan and
                  C. Pandu Rangan},
  title        = {Efficient Algorithms for the Minimum Weighted Dominating Clique Problem
                  on Permutation Graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {91},
  number       = {1},
  pages        = {1--21},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90265-4},
  doi          = {10.1016/0304-3975(91)90265-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SrinivasanR91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/Quattrocchi83,
  author       = {Pasquale Quattrocchi},
  title        = {A Class of Maximal Permutation Cliques},
  journal      = {Eur. J. Comb.},
  volume       = {4},
  number       = {4},
  pages        = {367--369},
  year         = {1983},
  url          = {https://doi.org/10.1016/S0195-6698(83)80033-X},
  doi          = {10.1016/S0195-6698(83)80033-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/Quattrocchi83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}