On some packing problem related to dynamic storage allocation
RAIRO-Theor. Inf. Appl., 22 4 (1988) 487-499
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Online coloring of short intervals
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos and Adam PolakEuropean Journal of Combinatorics 118 103919 (2024)
https://doi.org/10.1016/j.ejc.2024.103919
Online, computable and punctual structure theory
Matthew Askes and Rod DowneyLogic Journal of the IGPL 31 (6) 1251 (2023)
https://doi.org/10.1093/jigpal/jzac065
Improved lower bound on the on-line chain partitioning of semi-orders with representation
Csaba Biró and Israel R. CurbeloDiscrete Mathematics 346 (12) 113656 (2023)
https://doi.org/10.1016/j.disc.2023.113656
1201 (2023)
https://doi.org/10.1145/3564246.3585111
On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio
Bartosz BieganowskiDiscrete Mathematics, Algorithms and Applications 14 (08) (2022)
https://doi.org/10.1142/S1793830922500422
On-line partitioning of width w posets into wO(loglogw) chains
Bartłomiej Bosek and Tomasz KrawczykEuropean Journal of Combinatorics 91 103202 (2021)
https://doi.org/10.1016/j.ejc.2020.103202
Complexity and online algorithms for minimum skyline coloring of intervals
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W.H. Wong and Shmuel ZaksTheoretical Computer Science 788 66 (2019)
https://doi.org/10.1016/j.tcs.2019.05.007
On the performance guarantee of First Fit for sum coloring
Leah Epstein and Asaf LevinJournal of Computer and System Sciences 99 91 (2019)
https://doi.org/10.1016/j.jcss.2018.08.002
On spectrum assignment in elastic optical tree-networks
Jean-Claude Bermond and Fatima Zahra MoatazDiscrete Applied Mathematics 257 40 (2019)
https://doi.org/10.1016/j.dam.2018.09.021
First-fit coloring on interval graphs has performance ratio at least 5
H.A. Kierstead, David A. Smith and W.T. TrotterEuropean Journal of Combinatorics 51 236 (2016)
https://doi.org/10.1016/j.ejc.2015.05.015
Encyclopedia of Algorithms
Leah EpsteinEncyclopedia of Algorithms 1439 (2016)
https://doi.org/10.1007/978-1-4939-2864-4_264
A Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring
Tetsuya ARAKI and Koji M. KOBAYASHIIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A (10) 1885 (2016)
https://doi.org/10.1587/transfun.E99.A.1885
A subexponential upper bound for the on-line chain partitioning problem
Bartłomiej Bosek and Tomasz KrawczykCombinatorica 35 (1) 1 (2015)
https://doi.org/10.1007/s00493-014-2908-7
Encyclopedia of Algorithms
Leah EpsteinEncyclopedia of Algorithms 1 (2014)
https://doi.org/10.1007/978-3-642-27848-8_264-2
SOFSEM 2013: Theory and Practice of Computer Science
Balázs Keszegh, Nathan Lemons and Dömötör PálvölgyiLecture Notes in Computer Science, SOFSEM 2013: Theory and Practice of Computer Science 7741 292 (2013)
https://doi.org/10.1007/978-3-642-35843-2_26
Fundamentals of Parameterized Complexity
Rodney G. Downey and Michael R. FellowsTexts in Computer Science, Fundamentals of Parameterized Complexity 623 (2013)
https://doi.org/10.1007/978-1-4471-5559-1_31
On-Line Dimension for Posets Excluding Two Long Incomparable Chains
Stefan Felsner, Tomasz Krawczyk and William T. TrotterOrder 30 (1) 1 (2013)
https://doi.org/10.1007/s11083-011-9222-4
First-Fit Coloring of Incomparability Graphs
Bartłomiej Bosek, Tomasz Krawczyk and Grzegorz MateckiSIAM Journal on Discrete Mathematics 27 (1) 126 (2013)
https://doi.org/10.1137/110854394
On-Line Chain Partitions of Orders: A Survey
Bartłomiej Bosek, Stefan Felsner, Kamil Kloch, et al.Order 29 (1) 49 (2012)
https://doi.org/10.1007/s11083-011-9197-1
On the max coloring problem
Leah Epstein and Asaf LevinTheoretical Computer Science 462 23 (2012)
https://doi.org/10.1016/j.tcs.2012.07.037
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains
Vida Dujmović, Gwenaël Joret and David R. WoodSIAM Journal on Discrete Mathematics 26 (3) 1068 (2012)
https://doi.org/10.1137/110855806
Max-coloring and online coloring with bandwidths on interval graphs
Sriram V. Pemmaraju, Rajiv Raman and Kasturi VaradarajanACM Transactions on Algorithms 7 (3) 1 (2011)
https://doi.org/10.1145/1978782.1978790
Forbidden structures for efficient First-Fit chain partitioning (extended abstract)
Bartłomiej Bosek, Tomasz Krawczyk and Grzegorz MateckiElectronic Notes in Discrete Mathematics 38 173 (2011)
https://doi.org/10.1016/j.endm.2011.09.030
First-Fit coloring of bounded tolerance graphs
H.A. Kierstead and Karin R. SaoubDiscrete Applied Mathematics 159 (7) 605 (2011)
https://doi.org/10.1016/j.dam.2010.05.002
First-Fit is Linear on Posets Excluding Two Long Incomparable Chains
Gwenaël Joret and Kevin G. MilansOrder 28 (3) 455 (2011)
https://doi.org/10.1007/s11083-010-9184-y
347 (2010)
https://doi.org/10.1109/FOCS.2010.40
Online Capacitated Interval Coloring
Leah Epstein, Thomas Erlebach and Asaf LevinSIAM Journal on Discrete Mathematics 23 (2) 822 (2009)
https://doi.org/10.1137/070682496
Variable Sized Online Interval Coloring with Bandwidth
Leah Epstein, Thomas Erlebach and Asaf LevinAlgorithmica 53 (3) 385 (2009)
https://doi.org/10.1007/s00453-007-9071-0
Approximation and Online Algorithms
Leah Epstein and Asaf LevinLecture Notes in Computer Science, Approximation and Online Algorithms 4927 142 (2008)
https://doi.org/10.1007/978-3-540-77918-6_12
Online interval coloring with packing constraints
Leah Epstein and Meital LevyTheoretical Computer Science 407 (1-3) 203 (2008)
https://doi.org/10.1016/j.tcs.2008.05.018
Encyclopedia of Algorithms
Leah EpsteinEncyclopedia of Algorithms 594 (2008)
https://doi.org/10.1007/978-0-387-30162-4_264
A Note on First-Fit Coloring of Interval Graphs
N. S. Narayanaswamy and R. Subhash BabuOrder 25 (1) 49 (2008)
https://doi.org/10.1007/s11083-008-9076-6
The relative worst order ratio applied to seat reservation
Joan Boyar and Paul MedvedevACM Transactions on Algorithms 4 (4) 1 (2008)
https://doi.org/10.1145/1383369.1383379
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Leah Epstein, Thomas Erlebach and Asaf LevinLecture Notes in Computer Science, Combinatorics, Algorithms, Probabilistic and Experimental Methodologies 4614 243 (2007)
https://doi.org/10.1007/978-3-540-74450-4_22
Online promise problems with online width metrics
Rodney G. Downey and Catherine McCartinJournal of Computer and System Sciences 73 (1) 57 (2007)
https://doi.org/10.1016/j.jcss.2006.08.002
Algorithm Theory – SWAT 2006
Leah Epstein, Thomas Erlebach and Asaf LevinLecture Notes in Computer Science, Algorithm Theory – SWAT 2006 4059 29 (2006)
https://doi.org/10.1007/11785293_6
An improved algorithm for online coloring of intervals with bandwidth
Yossi Azar, Amos Fiat, Meital Levy and N.S. NarayanaswamyTheoretical Computer Science 363 (1) 18 (2006)
https://doi.org/10.1016/j.tcs.2006.06.014
Approximating interval coloring and max-coloring in chordal graphs
Sriram V. Pemmaraju, Sriram Penumatcha and Rajiv RamanACM Journal of Experimental Algorithmics 10 (2005)
https://doi.org/10.1145/1064546.1180619
Variants of Online Chain Partition Problem of Posets
Bartłomiej Bosek and Piotr MicekElectronic Notes in Theoretical Computer Science 140 3 (2005)
https://doi.org/10.1016/j.entcs.2005.06.028
On-line Chain Partitioning as a Model for Real-time Scheduling
Przemyslaw BroniekElectronic Notes in Theoretical Computer Science 140 15 (2005)
https://doi.org/10.1016/j.entcs.2005.06.027
On-line coloring and cliques covering for KKs,t-free graphs
Iwona CieślikActa Informatica 42 (1) 1 (2005)
https://doi.org/10.1007/s00236-005-0167-1
Automata, Languages and Programming
Leah Epstein and Meital LevyLecture Notes in Computer Science, Automata, Languages and Programming 3580 602 (2005)
https://doi.org/10.1007/11523468_49
Mathematical Foundations of Computer Science 2005
Leah Epstein and Meital LevyLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2005 3618 295 (2005)
https://doi.org/10.1007/11549345_26
Parameterized and Exact Computation
Rodney G. Downey and Catherine McCartinLecture Notes in Computer Science, Parameterized and Exact Computation 3162 13 (2004)
https://doi.org/10.1007/978-3-540-28639-4_2
Experimental and Efficient Algorithms
Sriram V. Pemmaraju, Sriram Penumatcha and Rajiv RamanLecture Notes in Computer Science, Experimental and Efficient Algorithms 3059 399 (2004)
https://doi.org/10.1007/978-3-540-24838-5_30
Approximation and Online Algorithms
Udo Adamy and Thomas ErlebachLecture Notes in Computer Science, Approximation and Online Algorithms 2909 1 (2004)
https://doi.org/10.1007/978-3-540-24592-6_1
OPTVersusLOADin Dynamic Storage Allocation
Adam L. Buchsbaum, Howard Karloff, Claire Kenyon, Nick Reingold and Mikkel ThorupSIAM Journal on Computing 33 (3) 632 (2004)
https://doi.org/10.1137/S0097539703423941
Seat reservation allowing seat changes
Joan Boyar, Susan Krarup and Morten N NielsenJournal of Algorithms 52 (2) 169 (2004)
https://doi.org/10.1016/j.jalgor.2004.02.002
Developments in Language Theory
Rodney G. Downey and Catherine McCartinLecture Notes in Computer Science, Developments in Language Theory 3340 12 (2004)
https://doi.org/10.1007/978-3-540-30550-7_2
556 (2003)
https://doi.org/10.1145/780542.780624
Computing and Combinatorics
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen and Morten N. NielsenLecture Notes in Computer Science, Computing and Combinatorics 2387 87 (2002)
https://doi.org/10.1007/3-540-45655-4_11
Handbook of Recursive Mathematics - Volume 2: Recursive Algebra, Analysis and Combinatorics
H.A. KiersteadStudies in Logic and the Foundations of Mathematics, Handbook of Recursive Mathematics - Volume 2: Recursive Algebra, Analysis and Combinatorics 139 1233 (1998)
https://doi.org/10.1016/S0049-237X(98)80051-7
Online Algorithms
Hal A. KiersteadLecture Notes in Computer Science, Online Algorithms 1442 281 (1998)
https://doi.org/10.1007/BFb0029574
Algorithms — ESA '96
Jordan GergovLecture Notes in Computer Science, Algorithms — ESA '96 1136 52 (1996)
https://doi.org/10.1007/3-540-61680-2_46
Optimal on-line coloring of circular arc graphs
Maciej ŚlusarekRAIRO - Theoretical Informatics and Applications 29 (5) 423 (1995)
https://doi.org/10.1051/ita/1995290504231
Mathematical Foundations of Computer Science 1989
Maciej SlusarekLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1989 379 471 (1989)
https://doi.org/10.1007/3-540-51486-4_93
The Linearity of First-Fit Coloring of Interval Graphs
H. A. KiersteadSIAM Journal on Discrete Mathematics 1 (4) 526 (1988)
https://doi.org/10.1137/0401048