Search dblp for Publications

export results for "toc:db/journals/ipl/ipl133.bht:"

 download as .bib file

@article{DBLP:journals/ipl/AvinHLS18,
  author    = {Chen Avin and
               Alexandr Hercules and
               Andreas Loukas and
               Stefan Schmid},
  title     = {\emph{rDAN}: Toward robust demand-aware network designs},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {5--9},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2017.12.008},
  doi       = {10.1016/j.ipl.2017.12.008},
  timestamp = {Mon, 06 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/AvinHLS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BampasKPP18,
  author    = {Evangelos Bampas and
               Christina Karousatou and
               Aris Pagourtzis and
               Katerina Potika},
  title     = {Path multicoloring in spider graphs with even color multiplicity},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {1--4},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2017.12.009},
  doi       = {10.1016/j.ipl.2017.12.009},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/BampasKPP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BouchardDPP18,
  author    = {S{\'{e}}bastien Bouchard and
               Yoann Dieudonn{\'{e}} and
               Andrzej Pelc and
               Franck Petit},
  title     = {On deterministic rendezvous at a node of agents with arbitrary velocities},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {39--43},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2018.01.003},
  doi       = {10.1016/j.ipl.2018.01.003},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/BouchardDPP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BringmannK18,
  author    = {Karl Bringmann and
               Sebastian Krinninger},
  title     = {A note on hardness of diameter approximation},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {10--15},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2017.12.010},
  doi       = {10.1016/j.ipl.2017.12.010},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/BringmannK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ducoffe18,
  author    = {Guillaume Ducoffe},
  title     = {A short note on the complexity of computing strong pathbreadth},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {56--58},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2018.01.005},
  doi       = {10.1016/j.ipl.2018.01.005},
  timestamp = {Mon, 19 Feb 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/Ducoffe18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FilhoOSC18,
  author    = {Madiel Conserva Filho and
               Marcel Vin{\'{\i}}cius Medeiros Oliveira and
               Augusto Sampaio and
               Ana Cavalcanti},
  title     = {Compositional and local livelock analysis for {CSP}},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {21--25},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2017.12.011},
  doi       = {10.1016/j.ipl.2017.12.011},
  timestamp = {Wed, 09 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/FilhoOSC18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManethS18,
  author    = {Sebastian Maneth and
               Helmut Seidl},
  title     = {Balancedness of {MSO} transductions in polynomial time},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {26--32},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2018.01.002},
  doi       = {10.1016/j.ipl.2018.01.002},
  timestamp = {Mon, 19 Feb 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/ManethS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MeirT18,
  author    = {Or Meir and
               Avishay Tal},
  title     = {The choice and agreement problems of a random function},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {16--20},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2017.12.007},
  doi       = {10.1016/j.ipl.2017.12.007},
  timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/MeirT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReisM18,
  author    = {Jacinto Reis and
               Alexandre Mota},
  title     = {Aiding exploratory testing with pruned {GUI} models},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {49--55},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2018.01.008},
  doi       = {10.1016/j.ipl.2018.01.008},
  timestamp = {Thu, 09 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/ReisM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SattariI18,
  author    = {Sattar Sattari and
               Mohammad Izadi},
  title     = {Upper bounds for minimum dilation triangulation in two special cases},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {33--38},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2018.01.001},
  doi       = {10.1016/j.ipl.2018.01.001},
  timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/SattariI18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ViardML18,
  author    = {Tiphaine Viard and
               Cl{\'{e}}mence Magnien and
               Matthieu Latapy},
  title     = {Enumerating maximal cliques in link streams with durations},
  journal   = {Inf. Process. Lett.},
  volume    = {133},
  pages     = {44--48},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.ipl.2018.01.006},
  doi       = {10.1016/j.ipl.2018.01.006},
  timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ipl/ViardML18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics