☰

BibLaTeX 书目中的某些行没有被破坏

tag-icon • tag-icon biblatex margins biber warnings layout
BibLaTeX 书目中的某些行没有被破坏

我的参考书目中的某些条目Overfull \hbox由于我不理解的原因而导致 es。以下是示例：

侵入文本边缘的参考书目条目的屏幕截图。

上面的例子已通过允许 ISBN 断开而得到修复\-，但我无法弄清楚下面的例子有什么问题：

第二个参考书目条目侵入文本边缘的屏幕截图。

这是我的主要文件：

\documentclass{article}
\usepackage[T1]{fontenc}
\usepackage{import}

\usepackage[
    backend=biber,
    style=alphabetic,
    citestyle=alphabetic,
    sorting=nyt
]{biblatex}
\addbibresource{refs.bib}

\begin{document}

    \nocite{*}
    \printbibliography[title={References}]\label{sec:paperrefs}

\end{document}

和refs.bib：

@inproceedings{Cook1971,
    author = {Cook, Stephen A.},
    title = {The Complexity of Theorem-Proving Procedures},
    year = {1971},
    isbn = {9781450374644},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    url = {https://doi.org/10.1145/800157.805047},
    doi = {10.1145/800157.805047},
    booktitle = {Proceedings of the Third Annual ACM Symposium on Theory of Computing},
    pages = {151–158},
    numpages = {8},
    location = {Shaker Heights, Ohio, USA},
    series = {STOC ’71}
}

@InCollection{sep-computational-complexity,
    author       =  {Dean, Walter},
    title        =  {Computational Complexity Theory},
    booktitle    =  {The Stanford Encyclopedia of Philosophy},
    editor       =  {Edward N. Zalta},
    howpublished =  {\url{https://plato.stanford.edu/archives/spr2017/entries/computational-complexity/}},
    year         =  {2017},
    edition      =  {Spring 2017},
    publisher    =  {Metaphysics Research Lab, Stanford University}
}

@misc{Friedman2002,
    author = "E. Friedman",
    title  = "Pushing blocks in gravity is NP-hard",
    year   = "2020"
}

@article{Garey1976,
    title={The Planar Hamiltonian Circuit Problem is NP-Complete},
    author={M. R. Garey and David S. Johnson and Robert E. Tarjan},
    journal={SIAM J. Comput.},
    year={1976},
    volume={5},
    pages={704-714}
}

@inproceedings{Demaine2001,
    title={Pushing blocks is np-complete for noncrossing solution paths},
    author={Erik D. Demaine and Michael Hoffmann},
    booktitle={CCCG},
    year={2001}
}

@phdthesis{Uehara1998,
    title    = {Probabilistic Algorithms and Complexity Classes},
    school   = {Department of Computer Science and Information Mathematics, The University of Electro-Communications},
    author   = {R. Uehara},
    year     = {1998}
}

@inproceedings{Uehara1990,
    title={Generalized Hi-Q is NP-Complete},
    author={Ryuhei Uehara and Shigeki Iwata},
    year={1990}
}

@article{Ravikumar2004,
    title = "Peg-solitaire, string rewriting systems and finite automata",
    journal = "Theoretical Computer Science",
    volume = "321",
    number = "2",
    pages = "383 - 394",
    year = "2004",
    issn = "0304-3975",
    doi = "https://doi.org/10.1016/j.tcs.2004.05.005",
    url = "http://www.sciencedirect.com/science/article/pii/S0304397504003688",
    author = "B Ravikumar",
    keywords = "Peg-solitaire, String rewriting system, Length-preserving, Change-bounded rewriting rule",
    abstract = "We consider a class of length-preserving string rewriting systems and show that the set of encodings of pairs of strings 〈s,f〉 such that f can be derived from s using the rewriting rules can be accepted by finite automata. As a consequence, we show the existence of a linear time algorithm for determining the solvability of a given k×n peg-solitaire board, for any fixed k. This result is in contrast to the results of (13) and (1) that the same problem is NP-hard for n×n boards. We look at some related string rewriting systems and find conditions under which the encodings of the pairs 〈s,f〉 where f can be derived from s is regular."
}

@article{Plesnk1979,
    title={The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two},
    author={J{\'a}n Plesn{\'i}k},
    journal={Inf. Process. Lett.},
    year={1979},
    volume={8},
    pages={199-201}
}

@Book{GPC,
    AUTHOR        = {Robert A. Hearn and Erik D. Demaine},
    TITLE         = {Games, Puzzles, and Computation},
    PUBLISHER     = {A K Peters},
    MONTH         = {July},
    YEAR          = {2009},
    length        = {250 pages}
}

@article{Turing1937,
    title={Computability and λ-definability},
    volume={2},
    DOI={10.2307/2268280},
    number={4},
    journal={Journal of Symbolic Logic},
    publisher={Cambridge University Press},
    author={Turing, A. M.},
    year={1937},
    pages={153–163}
}

Overfull hbox如果我仅引用该条目，则不会发生es Cook1971。

相关问题通常与 URL 有关，但我的参考书目中的大多数 URL 似乎都正确断开了。

为什么会发生这种情况？我该如何强制将参考书目条目放回到文本边距中？

答案1

MWE 无法为我重现严重损坏的 ISBN，而且问题Uehara1990并不那么明显。但无论如何。

允许 TeX 分解 ISBN 并NP-Complete大大增加获得更精细分解的书目的可能性，但不能保证它在所有情况下都有效，并且书目中的手动干预很困难。在如何调整参考书目的断行？我讨论了几种改进参考书目换行的方法。

相关内容