Search dblp for Publications

export results for "Problem 11392."

 download as .bib file

@article{DBLP:journals/dm/ImamuraS24,
  author       = {Koji Imamura and
                  Keisuke Shiromoto},
  title        = {Critical Problem for a q-analogue of polymatroids},
  journal      = {Discret. Math.},
  volume       = {347},
  number       = {5},
  pages        = {113924},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disc.2024.113924},
  doi          = {10.1016/J.DISC.2024.113924},
  timestamp    = {Mon, 27 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/ImamuraS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChlebikovaDP23,
  author       = {Janka Chleb{\'{\i}}kov{\'{a}} and
                  Cl{\'{e}}ment Dallard and
                  Niklas Paulsen},
  title        = {Impact of soft ride time constraints on the complexity of scheduling
                  in Dial-A-Ride Problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {960},
  pages        = {113923},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.113923},
  doi          = {10.1016/J.TCS.2023.113923},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ChlebikovaDP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Civril23a,
  author       = {Ali {\c{C}}ivril},
  title        = {Corrigendum to "A new approximation algorithm for the minimum 2-edge-connected
                  spanning subgraph problem" [Theor. Comput. Sci. 943 {(2023)} 121-130]},
  journal      = {Theor. Comput. Sci.},
  volume       = {963},
  pages        = {113926},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.113926},
  doi          = {10.1016/J.TCS.2023.113926},
  timestamp    = {Fri, 07 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Civril23a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cvpr/ShuHL23,
  author       = {Yangyang Shu and
                  Anton van den Hengel and
                  Lingqiao Liu},
  title        = {Learning Common Rationale to Improve Self-Supervised Representation
                  for Fine-Grained Visual Recognition Problems},
  booktitle    = {{IEEE/CVF} Conference on Computer Vision and Pattern Recognition,
                  {CVPR} 2023, Vancouver, BC, Canada, June 17-24, 2023},
  pages        = {11392--11401},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/CVPR52729.2023.01096},
  doi          = {10.1109/CVPR52729.2023.01096},
  timestamp    = {Tue, 29 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cvpr/ShuHL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/GuoSWH22,
  author       = {Liming Guo and
                  Qiwei Sheng and
                  Cheng Wang and
                  Ziping Huang},
  title        = {A modified weak Galerkin finite element method for nonmonotone quasilinear
                  elliptic problems},
  journal      = {J. Comput. Appl. Math.},
  volume       = {406},
  pages        = {113928},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.cam.2021.113928},
  doi          = {10.1016/J.CAM.2021.113928},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcam/GuoSWH22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/LiuWWN22,
  author       = {Ying Liu and
                  Gang Wang and
                  Mengyao Wu and
                  Yufeng Nie},
  title        = {A recovery-based a posteriori error estimator of the weak Galerkin
                  finite element method for elliptic problems},
  journal      = {J. Comput. Appl. Math.},
  volume       = {406},
  pages        = {113926},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.cam.2021.113926},
  doi          = {10.1016/J.CAM.2021.113926},
  timestamp    = {Tue, 22 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcam/LiuWWN22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11392,
  author       = {Michael V. Klibanov and
                  Thuy T. Le and
                  Loc H. Nguyen and
                  Anders Sullivan and
                  Lam H. Nguyen},
  title        = {Convexification-based globally convergent numerical method for a 1D
                  coefficient inverse problem with experimental data},
  journal      = {CoRR},
  volume       = {abs/2104.11392},
  year         = {2021},
  url          = {https://arxiv.org/abs/2104.11392},
  eprinttype    = {arXiv},
  eprint       = {2104.11392},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-11392.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/Kouba08,
  author       = {Omran Kouba},
  title        = {Problem 11392},
  journal      = {Am. Math. Mon.},
  volume       = {115},
  number       = {9},
  pages        = {855},
  year         = {2008},
  url          = {http://www.jstor.org/stable/27642617},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tamm/Kouba08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics