Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/siamdm/siamdm15.bht:"
download as .bib file
@article{DBLP:journals/siamdm/AlonK02,
author = {Noga Alon and
Michael Krivelevich},
title = {Testing k-colorability},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {211--227},
year = {2002},
url = {https://doi.org/10.1137/S0895480199358655},
doi = {10.1137/S0895480199358655},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AshirS02,
author = {Yaagoub Ashir and
Iain A. Stewart},
title = {Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {317--328},
year = {2002},
url = {https://doi.org/10.1137/S0895480196311183},
doi = {10.1137/S0895480196311183},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AshirS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BandeltC02,
author = {Hans{-}J{\"{u}}rgen Bandelt and
Victor Chepoi},
title = {Graphs with Connected Medians},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {268--282},
year = {2002},
url = {https://doi.org/10.1137/S089548019936360X},
doi = {10.1137/S089548019936360X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BandeltC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Barg02,
author = {Alexander Barg},
title = {On Some Polynomials Related to Weight Enumerators of Linear Codes},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {155--164},
year = {2002},
url = {https://doi.org/10.1137/S0895480199364148},
doi = {10.1137/S0895480199364148},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Barg02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BermanDM02,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan},
title = {Exact Size of Binary Space Partitionings and Improved Rectangle Tiling
Algorithms},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {252--267},
year = {2002},
url = {https://doi.org/10.1137/S0895480101384347},
doi = {10.1137/S0895480101384347},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BermanDM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BorodinW02,
author = {Oleg V. Borodin and
Douglas R. Woodall},
title = {Cyclic Colorings of 3-Polytopes with Large Maximum Face Size},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {143--154},
year = {2002},
url = {https://doi.org/10.1137/S089548019630248X},
doi = {10.1137/S089548019630248X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BorodinW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChengV02,
author = {Eddie Cheng and
Sven de Vries},
title = {On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {470--487},
year = {2002},
url = {https://doi.org/10.1137/S0895480101391053},
doi = {10.1137/S0895480101391053},
timestamp = {Sat, 01 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChengV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CornuejolsG02,
author = {G{\'{e}}rard Cornu{\'{e}}jols and
Bertrand Guenin},
title = {Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {329--352},
year = {2002},
url = {https://doi.org/10.1137/S0895480100371389},
doi = {10.1137/S0895480100371389},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CornuejolsG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DeogunK02,
author = {Jitender S. Deogun and
Dieter Kratsch},
title = {Dominating Pair Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {353--366},
year = {2002},
url = {https://doi.org/10.1137/S0895480100367111},
doi = {10.1137/S0895480100367111},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DeogunK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DuHJN02,
author = {Ding{-}Zhu Du and
Frank K. Hwang and
Xiaohua Jia and
Hung Q. Ngo},
title = {Optimal Consecutive-k-out-of-n: {G} Cycle for n {\textbackslash}leq
2k+1},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {305--316},
year = {2002},
url = {https://doi.org/10.1137/S0895480100375041},
doi = {10.1137/S0895480100375041},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DuHJN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FishburnW02,
author = {Peter C. Fishburn and
Paul E. Wright},
title = {Interference Patterns in Regular Graphs with Bijective Colorings},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {382--402},
year = {2002},
url = {https://doi.org/10.1137/S0895480100382342},
doi = {10.1137/S0895480100382342},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FishburnW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoemansQSSW02,
author = {Michel X. Goemans and
Maurice Queyranne and
Andreas S. Schulz and
Martin Skutella and
Yaoguang Wang},
title = {Single Machine Scheduling with Release Dates},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {165--192},
year = {2002},
url = {https://doi.org/10.1137/S089548019936223X},
doi = {10.1137/S089548019936223X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GoemansQSSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HassinR02,
author = {Refael Hassin and
Shlomi Rubinstein},
title = {Robust Matchings},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {530--537},
year = {2002},
url = {https://doi.org/10.1137/S0895480198332156},
doi = {10.1137/S0895480198332156},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HassinR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HaynesHHH02,
author = {Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Michael A. Henning},
title = {Domination in Graphs Applied to Electric Power Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {519--529},
year = {2002},
url = {https://doi.org/10.1137/S0895480100375831},
doi = {10.1137/S0895480100375831},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HaynesHHH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HonkalaK02,
author = {Iiro S. Honkala and
Andrew Klapper},
title = {Multicovering Bounds from Relative Covering Radii},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {228--234},
year = {2002},
url = {https://doi.org/10.1137/S089548010037935X},
doi = {10.1137/S089548010037935X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HonkalaK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HsiehHHKC02,
author = {Sun{-}Yuan Hsieh and
Chin{-}Wen Ho and
Tsan{-}sheng Hsu and
Ming{-}Tat Ko and
Gen{-}Huey Chen},
title = {Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {488--518},
year = {2002},
url = {https://doi.org/10.1137/S0895480101389880},
doi = {10.1137/S0895480101389880},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HsiehHHKC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Kitchens02,
author = {Bruce Kitchens},
title = {Multidimensional Convolutional Codes},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {367--381},
year = {2002},
url = {https://doi.org/10.1137/S0895480100378495},
doi = {10.1137/S0895480100378495},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Kitchens02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KlavzarM02,
author = {Sandi Klavzar and
Henry Martyn Mulder},
title = {Partial Cubes and Crossing Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {235--251},
year = {2002},
url = {https://doi.org/10.1137/S0895480101383202},
doi = {10.1137/S0895480101383202},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KlavzarM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KratschS02,
author = {Dieter Kratsch and
Lorna Stewart},
title = {Approximating Bandwidth by Mixing Layouts of Interval Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {435--449},
year = {2002},
url = {https://doi.org/10.1137/S0895480199359624},
doi = {10.1137/S0895480199359624},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KratschS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PelegW02,
author = {David Peleg and
Avishai Wool},
title = {How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {416--433},
year = {2002},
url = {https://doi.org/10.1137/S0895480198343819},
doi = {10.1137/S0895480198343819},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PelegW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Ranto02,
author = {Kalle Ranto},
title = {Infinite Families of 3-Designs from Z\({}_{\mbox{4}}\)-Goethals Codes
with Block Size 8},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {289--304},
year = {2002},
url = {https://doi.org/10.1137/S0895480101385882},
doi = {10.1137/S0895480101385882},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Ranto02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Rizzi02,
author = {Romeo Rizzi},
title = {Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {283--288},
year = {2002},
url = {https://doi.org/10.1137/S0895480199351136},
doi = {10.1137/S0895480199351136},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Rizzi02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Sawada02,
author = {Joe Sawada},
title = {A Fast Algorithm for Generating Nonisomorphic Chord Diagrams},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {546--561},
year = {2002},
url = {https://doi.org/10.1137/S0895480100377970},
doi = {10.1137/S0895480100377970},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Sawada02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Schrijver02,
author = {Alexander Schrijver},
title = {Strong T-Perfection of Bad-K\({}_{\mbox{4}}\)-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {3},
pages = {403--415},
year = {2002},
url = {https://doi.org/10.1137/S0895480101401101},
doi = {10.1137/S0895480101401101},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Schrijver02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SchulzS02,
author = {Andreas S. Schulz and
Martin Skutella},
title = {Scheduling Unrelated Machines by Randomized Rounding},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {450--469},
year = {2002},
url = {https://doi.org/10.1137/S0895480199357078},
doi = {10.1137/S0895480199357078},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SchulzS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SteelS02,
author = {Michael Anthony Steel and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
title = {Inverting Random Functions {II:} Explicit Bounds for Discrete Maximum
Likelihood Estimation, with Applications},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {562--575},
year = {2002},
url = {https://doi.org/10.1137/S089548010138790X},
doi = {10.1137/S089548010138790X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/SteelS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Wang02,
author = {Biing{-}Feng Wang},
title = {Finding a 2-Core of a Tree in Linear Time},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {193--210},
year = {2002},
url = {https://doi.org/10.1137/S0895480100374242},
doi = {10.1137/S0895480100374242},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Wang02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/WangL02,
author = {Wei{-}Fan Wang and
Ko{-}Wei Lih},
title = {Choosability and Edge Choosability of Planar Graphs without Intersecting
Triangles},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {538--545},
year = {2002},
url = {https://doi.org/10.1137/S0895480100376253},
doi = {10.1137/S0895480100376253},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/WangL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonSZ01,
author = {Noga Alon and
Benny Sudakov and
Uri Zwick},
title = {Constructing Worst Case Instances for Semidefinite Programming Based
Approximation Algorithms},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {58--72},
year = {2001},
url = {https://doi.org/10.1137/S0895480100379713},
doi = {10.1137/S0895480100379713},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonSZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BlackmoreN01,
author = {Tim Blackmore and
Graham H. Norton},
title = {Determining When the Absolute State Complexity of a Hermitian Code
Achieves Its {DLP} Bound},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {14--40},
year = {2001},
url = {https://doi.org/10.1137/S0895480100376435},
doi = {10.1137/S0895480100376435},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BlackmoreN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DoignonF01,
author = {Jean{-}Paul Doignon and
Samuel Fiorini},
title = {Facets of the Weak Order Polytope Derived from the Induced Partition
Projection},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {112--121},
year = {2001},
url = {https://doi.org/10.1137/S0895480100369936},
doi = {10.1137/S0895480100369936},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DoignonF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DolevHLNP01,
author = {Danny Dolev and
Yuval Harari and
Nathan Linial and
Noam Nisan and
Michal Parnas},
title = {Neighborhood Preserving Hashing and Approximate Queries},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {73--85},
year = {2001},
url = {https://doi.org/10.1137/S089548019731809X},
doi = {10.1137/S089548019731809X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DolevHLNP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FiolG01,
author = {Miguel Angel Fiol and
Ernest Garriga},
title = {An Algebraic Characterization of Completely Regular Codes in Distance-Regular
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {1--13},
year = {2001},
url = {https://doi.org/10.1137/S0895480100376496},
doi = {10.1137/S0895480100376496},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FiolG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GarnierK01,
author = {Josselin Garnier and
Leila Kallel},
title = {Efficiency of Local Search with Multiple Local Optima},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {122--141},
year = {2001},
url = {https://doi.org/10.1137/S0895480199355225},
doi = {10.1137/S0895480199355225},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GarnierK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HanckowiakKP01,
author = {Michal Hanckowiak and
Michal Karonski and
Alessandro Panconesi},
title = {On the Distributed Complexity of Computing Maximal Matchings},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {41--57},
year = {2001},
url = {https://doi.org/10.1137/S0895480100373121},
doi = {10.1137/S0895480100373121},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HanckowiakKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Wang01,
author = {Hong Wang},
title = {On Covering a Bipartite Graph with Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {86--96},
year = {2001},
url = {https://doi.org/10.1137/S0895480196310487},
doi = {10.1137/S0895480196310487},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Wang01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ZelikovskyM01,
author = {Alexander Zelikovsky and
Ion I. Mandoiu},
title = {Practical Approximation Algorithms for Zero- and Bounded-Skew Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {1},
pages = {97--111},
year = {2001},
url = {https://doi.org/10.1137/S0895480100378367},
doi = {10.1137/S0895480100378367},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ZelikovskyM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-27 05:57 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
