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}
}

@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}
}

@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}
}

@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}
}

@inproceedings{DBLP:conf/cpm/Tiskin06,
  author       = {Alexandre Tiskin},
  title        = {Longest Common Subsequences in Permutations and Maximum Cliques in
                  Circle Graphs},
  booktitle    = {{CPM}},
  series       = {Lecture Notes in Computer Science},
  volume       = {4009},
  pages        = {270--281},
  publisher    = {Springer},
  year         = {2006}
}

@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}
}

@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}
}

@inproceedings{DBLP:conf/gecco/MatsuiT00,
  author       = {Shouichi Matsui and
                  Ken{-}ichi Tokoro},
  title        = {A New Genetic Algorithm for Minimum Span Frequency Assignment using
                  Permutation and Clique},
  booktitle    = {{GECCO}},
  pages        = {682--689},
  publisher    = {Morgan Kaufmann},
  year         = {2000}
}

@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}
}

@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}
}

@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}
}