---
_id: '11802'
abstract:
- lang: eng
  text: In this paper we survey algorithmic aspects of Web information retrieval.
    As an example, we discuss ranking of search engine results using connectivity
    analysis.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Henzinger MH. Web information retrieval - an algorithmic perspective. In:
    <i>8th Annual European Symposium on Algorithms</i>. Vol 1879. Springer Nature;
    2000:1–8. doi:<a href="https://doi.org/10.1007/3-540-45253-2_1">10.1007/3-540-45253-2_1</a>'
  apa: 'Henzinger, M. H. (2000). Web information retrieval - an algorithmic perspective.
    In <i>8th Annual European Symposium on Algorithms</i> (Vol. 1879, pp. 1–8). Saarbrücken,
    Germany: Springer Nature. <a href="https://doi.org/10.1007/3-540-45253-2_1">https://doi.org/10.1007/3-540-45253-2_1</a>'
  chicago: Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.”
    In <i>8th Annual European Symposium on Algorithms</i>, 1879:1–8. Springer Nature,
    2000. <a href="https://doi.org/10.1007/3-540-45253-2_1">https://doi.org/10.1007/3-540-45253-2_1</a>.
  ieee: M. H. Henzinger, “Web information retrieval - an algorithmic perspective,”
    in <i>8th Annual European Symposium on Algorithms</i>, Saarbrücken, Germany, 2000,
    vol. 1879, pp. 1–8.
  ista: 'Henzinger MH. 2000. Web information retrieval - an algorithmic perspective.
    8th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms,
    LNCS, vol. 1879, 1–8.'
  mla: Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.”
    <i>8th Annual European Symposium on Algorithms</i>, vol. 1879, Springer Nature,
    2000, pp. 1–8, doi:<a href="https://doi.org/10.1007/3-540-45253-2_1">10.1007/3-540-45253-2_1</a>.
  short: M.H. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer
    Nature, 2000, pp. 1–8.
conference:
  end_date: 2000-09-08
  location: Saarbrücken, Germany
  name: 'ESA: European Symposium on Algorithms'
  start_date: 2000-09-05
date_created: 2022-08-11T13:25:07Z
date_published: 2000-09-01T00:00:00Z
date_updated: 2023-02-13T12:08:21Z
day: '01'
doi: 10.1007/3-540-45253-2_1
extern: '1'
intvolume: '      1879'
language:
- iso: eng
month: '09'
oa_version: None
page: 1–8
publication: 8th Annual European Symposium on Algorithms
publication_identifier:
  eisbn:
  - '9783540452539'
  eissn:
  - 1611-3349
  isbn:
  - '9783540410041'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Web information retrieval - an algorithmic perspective
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1879
year: '2000'
...
---
_id: '11803'
abstract:
- lang: eng
  text: We present the first fully dynamic algorithm for maintaining a minimum spanning
    tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log
    n) amortized time per update operation. The algorithm is fairly simple and deterministic.
    An immediate consequence is the first fully dynamic deterministic algorithm for
    maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per
    update, with O(1) worst case time per query.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Valerie
  full_name: King, Valerie
  last_name: King
citation:
  ama: 'Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs.
    In: <i>24th International Colloquium on Automata, Languages and Programming</i>.
    Vol 1256. Springer Nature; 1997:594–604. doi:<a href="https://doi.org/10.1007/3-540-63165-8_214">10.1007/3-540-63165-8_214</a>'
  apa: 'Henzinger, M. H., &#38; King, V. (1997). Maintaining minimum spanning trees
    in dynamic graphs. In <i>24th International Colloquium on Automata, Languages
    and Programming</i> (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature.
    <a href="https://doi.org/10.1007/3-540-63165-8_214">https://doi.org/10.1007/3-540-63165-8_214</a>'
  chicago: Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees
    in Dynamic Graphs.” In <i>24th International Colloquium on Automata, Languages
    and Programming</i>, 1256:594–604. Springer Nature, 1997. <a href="https://doi.org/10.1007/3-540-63165-8_214">https://doi.org/10.1007/3-540-63165-8_214</a>.
  ieee: M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic
    graphs,” in <i>24th International Colloquium on Automata, Languages and Programming</i>,
    Bologna, Italy, 1997, vol. 1256, pp. 594–604.
  ista: 'Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic
    graphs. 24th International Colloquium on Automata, Languages and Programming.
    ICALP: International Colloquium on Automata, Languages, and Programming, LNCS,
    vol. 1256, 594–604.'
  mla: Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees
    in Dynamic Graphs.” <i>24th International Colloquium on Automata, Languages and
    Programming</i>, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:<a href="https://doi.org/10.1007/3-540-63165-8_214">10.1007/3-540-63165-8_214</a>.
  short: M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata,
    Languages and Programming, Springer Nature, 1997, pp. 594–604.
conference:
  end_date: 1997-07-11
  location: Bologna, Italy
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 1997-07-07
date_created: 2022-08-11T13:35:06Z
date_published: 1997-07-01T00:00:00Z
date_updated: 2023-02-14T07:49:03Z
day: '01'
doi: 10.1007/3-540-63165-8_214
extern: '1'
intvolume: '      1256'
language:
- iso: eng
month: '07'
oa_version: None
page: 594–604
publication: 24th International Colloquium on Automata, Languages and Programming
publication_identifier:
  eisbn:
  - '9783540691945'
  eissn:
  - 1611-3349
  isbn:
  - '9783540631651'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maintaining minimum spanning trees in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1256
year: '1997'
...
---
_id: '11804'
abstract:
- lang: eng
  text: "This paper shows how a general technique, called lock-step search, used in
    dynamic graph algorithms, can be used to improve the running time of two problems
    arising in program verification and communication protocol design.\r\n(1)We consider
    the nonemptiness problem for Streett automata: We are given a directed graph G
    = (V, E) with n = ¦V¦ and m = ¦E¦, and a collection of pairs of subsets of vertices,
    called Streett pairs,〈L i , U i 〉, i = 1.k. The question is whether G has a cycle
    (not necessarily simple) which, for each 1 ≤ i ≤ k, if it contains a vertex from
    L i then it also contains a vertex of U i . Let b=Σ i=1..k |L i |+|U i |. The
    previously best algorithm takes time O((m + b) min{n, k}). We present an algorithm
    that takes time \U0001D442(\U0001D45Amin{\U0001D45A\U0001D459\U0001D45C\U0001D454\U0001D45B,‾‾‾‾‾‾√\U0001D458,\U0001D45B}+\U0001D44F\U0001D45A\U0001D456\U0001D45B{\U0001D459\U0001D45C\U0001D454\U0001D45B,\U0001D458}).\r\n(2)In
    communication protocol pruning we are given a directed graph G = (V, E) with l
    special vertices. The problem is to efficiently maintain the strongly-connected
    components of the special vertices on a restricted set of edge deletions. Let
    m i be the number of edges in the strongly connected component of the ith special
    vertex. The previously best algorithm repeatedly recomputes the strongly-connected
    components which leads to a running time of O(Σ i m 2i). We present an algorithm
    with time \U0001D442(\U0001D459√∑\U0001D456\U0001D45A1.5\U0001D456)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Jan Arne
  full_name: Telle, Jan Arne
  last_name: Telle
citation:
  ama: 'Henzinger MH, Telle JA. Faster algorithms for the nonemptiness of streett
    automata and for communication protocol pruning. In: <i>5th Scandinavian Workshop
    on Algorithm Theory</i>. Vol 1097. Springer Nature; 1996:16–27. doi:<a href="https://doi.org/10.1007/3-540-61422-2_117">10.1007/3-540-61422-2_117</a>'
  apa: 'Henzinger, M. H., &#38; Telle, J. A. (1996). Faster algorithms for the nonemptiness
    of streett automata and for communication protocol pruning. In <i>5th Scandinavian
    Workshop on Algorithm Theory</i> (Vol. 1097, pp. 16–27). Reykjavik, Iceland: Springer
    Nature. <a href="https://doi.org/10.1007/3-540-61422-2_117">https://doi.org/10.1007/3-540-61422-2_117</a>'
  chicago: Henzinger, Monika H, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness
    of Streett Automata and for Communication Protocol Pruning.” In <i>5th Scandinavian
    Workshop on Algorithm Theory</i>, 1097:16–27. Springer Nature, 1996. <a href="https://doi.org/10.1007/3-540-61422-2_117">https://doi.org/10.1007/3-540-61422-2_117</a>.
  ieee: M. H. Henzinger and J. A. Telle, “Faster algorithms for the nonemptiness of
    streett automata and for communication protocol pruning,” in <i>5th Scandinavian
    Workshop on Algorithm Theory</i>, Reykjavik, Iceland, 1996, vol. 1097, pp. 16–27.
  ista: 'Henzinger MH, Telle JA. 1996. Faster algorithms for the nonemptiness of streett
    automata and for communication protocol pruning. 5th Scandinavian Workshop on
    Algorithm Theory. SWAT: Scandinavian Workshop on Algorithm Theory, LNCS, vol.
    1097, 16–27.'
  mla: Henzinger, Monika H., and Jan Arne Telle. “Faster Algorithms for the Nonemptiness
    of Streett Automata and for Communication Protocol Pruning.” <i>5th Scandinavian
    Workshop on Algorithm Theory</i>, vol. 1097, Springer Nature, 1996, pp. 16–27,
    doi:<a href="https://doi.org/10.1007/3-540-61422-2_117">10.1007/3-540-61422-2_117</a>.
  short: M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory,
    Springer Nature, 1996, pp. 16–27.
conference:
  end_date: 1996-07-05
  location: Reykjavik, Iceland
  name: 'SWAT: Scandinavian Workshop on Algorithm Theory'
  start_date: 1996-07-03
date_created: 2022-08-11T13:42:42Z
date_published: 1996-07-01T00:00:00Z
date_updated: 2023-02-14T07:52:17Z
day: '01'
doi: 10.1007/3-540-61422-2_117
extern: '1'
intvolume: '      1097'
language:
- iso: eng
month: '07'
oa_version: None
page: 16–27
publication: 5th Scandinavian Workshop on Algorithm Theory
publication_identifier:
  eisbn:
  - '9783540685296'
  eissn:
  - 1611-3349
  isbn:
  - '9783540614227'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for the nonemptiness of streett automata and for communication
  protocol pruning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1097
year: '1996'
...
---
_id: '11910'
abstract:
- lang: eng
  text: "We state a new sampling lemma and use it to improve the running time of dynamic
    graph algorithms.\r\n\r\nFor the dynamic connectivity problem the previously best
    randomized algorithm takes expected time O(log3 n) per update, amortized over
    Ω(m) updates. Using the new sampling lemma, we improve its running time to O(log2
    n). There exists a lower bound in the cell probe model for the time per operation
    of Ω(log n/ log log n) for this problem.\r\n\r\nSimilarly improved running times
    are achieved for 2-edge connectivity, k-weight minimum spanning tree, and bipartiteness."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Mikkel
  full_name: Thorup, Mikkel
  last_name: Thorup
citation:
  ama: 'Henzinger MH, Thorup M. Improved sampling with applications to dynamic graph
    algorithms. In: <i>23rd International Colloquium on Automata, Languages, and Programming</i>.
    Vol 1099. Springer Nature; 1996:290-299. doi:<a href="https://doi.org/10.1007/3-540-61440-0_136">10.1007/3-540-61440-0_136</a>'
  apa: 'Henzinger, M. H., &#38; Thorup, M. (1996). Improved sampling with applications
    to dynamic graph algorithms. In <i>23rd International Colloquium on Automata,
    Languages, and Programming</i> (Vol. 1099, pp. 290–299). Paderborn, Germany: Springer
    Nature. <a href="https://doi.org/10.1007/3-540-61440-0_136">https://doi.org/10.1007/3-540-61440-0_136</a>'
  chicago: Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications
    to Dynamic Graph Algorithms.” In <i>23rd International Colloquium on Automata,
    Languages, and Programming</i>, 1099:290–99. Springer Nature, 1996. <a href="https://doi.org/10.1007/3-540-61440-0_136">https://doi.org/10.1007/3-540-61440-0_136</a>.
  ieee: M. H. Henzinger and M. Thorup, “Improved sampling with applications to dynamic
    graph algorithms,” in <i>23rd International Colloquium on Automata, Languages,
    and Programming</i>, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.
  ista: 'Henzinger MH, Thorup M. 1996. Improved sampling with applications to dynamic
    graph algorithms. 23rd International Colloquium on Automata, Languages, and Programming.
    ICALP: International Colloquium on Automata, Languages, and Programming, LNCS,
    vol. 1099, 290–299.'
  mla: Henzinger, Monika H., and Mikkel Thorup. “Improved Sampling with Applications
    to Dynamic Graph Algorithms.” <i>23rd International Colloquium on Automata, Languages,
    and Programming</i>, vol. 1099, Springer Nature, 1996, pp. 290–99, doi:<a href="https://doi.org/10.1007/3-540-61440-0_136">10.1007/3-540-61440-0_136</a>.
  short: M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata,
    Languages, and Programming, Springer Nature, 1996, pp. 290–299.
conference:
  end_date: 1996-07-12
  location: Paderborn, Germany
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 1996-07-08
date_created: 2022-08-18T06:42:24Z
date_published: 1996-07-01T00:00:00Z
date_updated: 2023-02-14T07:57:14Z
day: '01'
doi: 10.1007/3-540-61440-0_136
extern: '1'
intvolume: '      1099'
language:
- iso: eng
month: '07'
oa_version: None
page: 290-299
publication: 23rd International Colloquium on Automata, Languages, and Programming
publication_identifier:
  eisbn:
  - '9783540685807'
  eissn:
  - 1611-3349
  isbn:
  - '9783540614401'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved sampling with applications to dynamic graph algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1099
year: '1996'
...
---
_id: '11805'
abstract:
- lang: eng
  text: In this paper, we present sparse certificates for biconnectivity together
    with algorithms for updating these certificates. We thus obtain fully-dynamic
    algorithms for biconnectivity in graphs that run in O(√n log n log⌈m/n⌉) amortized
    time per operation, where m is the number of edges and n is the number of nodes
    in the graph. This improves upon the results in [11], in which algorithms were
    presented running in O(√m) amortized time, and solves the open problem to find
    certificates to speed up biconnectivity, as stated in [2].
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Han
  full_name: Poutré, Han
  last_name: Poutré
citation:
  ama: 'Henzinger MH, Poutré H. Certificates and fast algorithms for biconnectivity
    in fully-dynamic graphs. In: <i>3rd Annual European Symposium on Algorithms</i>.
    Vol 979. Springer Nature; 1995:171–184. doi:<a href="https://doi.org/10.1007/3-540-60313-1_142">10.1007/3-540-60313-1_142</a>'
  apa: 'Henzinger, M. H., &#38; Poutré, H. (1995). Certificates and fast algorithms
    for biconnectivity in fully-dynamic graphs. In <i>3rd Annual European Symposium
    on Algorithms</i> (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature. <a
    href="https://doi.org/10.1007/3-540-60313-1_142">https://doi.org/10.1007/3-540-60313-1_142</a>'
  chicago: Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms
    for Biconnectivity in Fully-Dynamic Graphs.” In <i>3rd Annual European Symposium
    on Algorithms</i>, 979:171–184. Springer Nature, 1995. <a href="https://doi.org/10.1007/3-540-60313-1_142">https://doi.org/10.1007/3-540-60313-1_142</a>.
  ieee: M. H. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity
    in fully-dynamic graphs,” in <i>3rd Annual European Symposium on Algorithms</i>,
    Corfu, Greece, 1995, vol. 979, pp. 171–184.
  ista: 'Henzinger MH, Poutré H. 1995. Certificates and fast algorithms for biconnectivity
    in fully-dynamic graphs. 3rd Annual European Symposium on Algorithms. ESA: European
    Symposium on Algorithms, LNCS, vol. 979, 171–184.'
  mla: Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for
    Biconnectivity in Fully-Dynamic Graphs.” <i>3rd Annual European Symposium on Algorithms</i>,
    vol. 979, Springer Nature, 1995, pp. 171–184, doi:<a href="https://doi.org/10.1007/3-540-60313-1_142">10.1007/3-540-60313-1_142</a>.
  short: M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms,
    Springer Nature, 1995, pp. 171–184.
conference:
  end_date: 1995-09-27
  location: Corfu, Greece
  name: 'ESA: European Symposium on Algorithms'
  start_date: 1995-09-25
date_created: 2022-08-11T14:09:52Z
date_published: 1995-09-01T00:00:00Z
date_updated: 2023-02-14T08:02:03Z
day: '01'
doi: 10.1007/3-540-60313-1_142
extern: '1'
intvolume: '       979'
language:
- iso: eng
month: '09'
oa_version: None
page: 171–184
publication: 3rd Annual European Symposium on Algorithms
publication_identifier:
  eisbn:
  - '9783540449133'
  eissn:
  - 1611-3349
  isbn:
  - '9783540603139'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 979
year: '1995'
...
---
_id: '11806'
abstract:
- lang: eng
  text: This paper presents insertions-only algorithms for maintaining the exact and
    approximate size of the minimum edge cut and the minimum vertex cut of a graph.
    The algorithms output the approximate or exact size k in time O(1) or O(log n)
    and a cut of size k in time linear in its size. The amortized time per insertion
    is O(1/ε 2) for a (2+ε)-approximation, O((log λ)((log n)/ε)2) for a (1+ε)-approximation,
    and O(λ log n) for the exact size of the minimum edge cut, where n is the number
    of nodes in the graph, λ is the size of the minimum cut and ε>0. The (2+ε)-approximation
    algorithm and the exact algorithm are deterministic, the (1+ε)-approximation algorithm
    is randomized. The algorithms are optimal in the sense that the time needed for
    m insertions matches the time needed by the best static algorithm on a m-edge
    graph. We also present a static 2-approximation algorithm for the size κ of the
    minimum vertex cut in a graph, which takes time O(n 2 min(√n,κ)). This is a factor
    of κ faster than the best algorithm for computing the exact size, which takes
    time O(κ 2 n 2 +κ 3 n 1.5). We give an insertionsonly algorithm for maintaining
    a (2+ε)-approximation of the minimum vertex cut with amortized insertion time
    O(n(logκk)/ε).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Henzinger MH. Approximating minimum cuts under insertions. In: <i>22nd International
    Colloquium on Automata, Languages and Programming</i>. Vol 944. Springer Nature;
    1995:280–291. doi:<a href="https://doi.org/10.1007/3-540-60084-1_81">10.1007/3-540-60084-1_81</a>'
  apa: 'Henzinger, M. H. (1995). Approximating minimum cuts under insertions. In <i>22nd
    International Colloquium on Automata, Languages and Programming</i> (Vol. 944,
    pp. 280–291). Szeged, Hungary: Springer Nature. <a href="https://doi.org/10.1007/3-540-60084-1_81">https://doi.org/10.1007/3-540-60084-1_81</a>'
  chicago: Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” In
    <i>22nd International Colloquium on Automata, Languages and Programming</i>, 944:280–291.
    Springer Nature, 1995. <a href="https://doi.org/10.1007/3-540-60084-1_81">https://doi.org/10.1007/3-540-60084-1_81</a>.
  ieee: M. H. Henzinger, “Approximating minimum cuts under insertions,” in <i>22nd
    International Colloquium on Automata, Languages and Programming</i>, Szeged, Hungary,
    1995, vol. 944, pp. 280–291.
  ista: 'Henzinger MH. 1995. Approximating minimum cuts under insertions. 22nd International
    Colloquium on Automata, Languages and Programming. ICALP: International Colloquium
    on Automata, Languages, and Programming, LNCS, vol. 944, 280–291.'
  mla: Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” <i>22nd
    International Colloquium on Automata, Languages and Programming</i>, vol. 944,
    Springer Nature, 1995, pp. 280–291, doi:<a href="https://doi.org/10.1007/3-540-60084-1_81">10.1007/3-540-60084-1_81</a>.
  short: M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages
    and Programming, Springer Nature, 1995, pp. 280–291.
conference:
  end_date: 1995-07-14
  location: Szeged, Hungary
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 1995-07-10
date_created: 2022-08-11T14:17:33Z
date_published: 1995-07-01T00:00:00Z
date_updated: 2023-02-14T08:09:08Z
day: '01'
doi: 10.1007/3-540-60084-1_81
extern: '1'
intvolume: '       944'
language:
- iso: eng
month: '07'
oa_version: None
page: 280–291
publication: 22nd International Colloquium on Automata, Languages and Programming
publication_identifier:
  eisbn:
  - '9783540600848'
  eissn:
  - 1611-3349
  isbn:
  - '9783540494256'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating minimum cuts under insertions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 944
year: '1995'
...