{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T02:28:45Z","timestamp":1771381725253,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030489656","type":"print"},{"value":"9783030489663","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_12","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"154-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fair Packing of Independent Sets"],"prefix":"10.1007","author":[{"given":"Nina","family":"Chiarelli","sequence":"first","affiliation":[]},{"given":"Matja\u017e","family":"Krnc","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[]},{"given":"Nevena","family":"Piva\u010d","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Schauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"issue":"1\u20133","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00217-6","volume":"103","author":"N Abbas","year":"2000","unstructured":"Abbas, N., Stewart, L.K.: Biconvex graphs: ordering and algorithms. Discret. Appl. Math. 103(1\u20133), 1\u201319 (2000)","journal-title":"Discret. Appl. Math."},{"key":"12_CR2","unstructured":"Alekseev, V.E.: The effect of local constraints on the complexity of determination of the graph independence number. In: Combinatorial-Algebraic Methods in Applied Mathematics, pp. 3\u201313. Gorky University Press (1982). (in Russian)"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3070694","volume":"13","author":"C Annamalai","year":"2017","unstructured":"Annamalai, C., Kalaitzis, C., Svensson, O.: Combinatorial algorithm for restricted max-min fair allocation. ACM Trans. Algorithms 13(3), 1\u201328 (2017)","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-Y","volume":"1","author":"Y Azar","year":"1998","unstructured":"Azar, Y., Epstein, L.: On-line machine covering. J. Sched. 1, 67\u201377 (1998)","journal-title":"J. Sched."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"issue":"1\u20132","key":"12_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0012-365X(89)90193-3","volume":"74","author":"C Berge","year":"1989","unstructured":"Berge, C.: Minimax relations for the partial $$q$$-colorings of a graph. Discret. Math. 74(1\u20132), 3\u201314 (1989)","journal-title":"Discret. Math."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I Bezakova","year":"2005","unstructured":"Bezakova, I., Dani, V.: Allocating indivisible goods. ACM SIGecom Exchanges 5(3), 11\u201318 (2005)","journal-title":"ACM SIGecom Exchanges"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-57182-5_21","volume-title":"Mathematical Foundations of Computer Science 1993","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of scheduling incompatible jobs with unit-times. In: Borzyszkowski, A.M., Soko\u0142owski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 291\u2013300. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_21"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1017\/CBO9781107446984.013","volume-title":"Handbook of Computational Social Choice","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair allocation of indivisible goods. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, pp. 284\u2013310. Cambridge University Press, Cambridge (2016)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM) (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.dam.2010.12.016","volume":"159","author":"A Darmann","year":"2011","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.: Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159, 1726\u20131735 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"BL Deuermeyer","year":"1982","unstructured":"Deuermeyer, B.L., Friesen, D.K., Langston, M.A.: Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J. Algebraic Discret. Methods 3(2), 190\u2013196 (1982)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10951-008-0089-1","volume":"12","author":"G Even","year":"2009","unstructured":"Even, G., Halld\u00f3rsson, M.M., Kaplan, L., Ron, D.: Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2), 199\u2013224 (2009)","journal-title":"J. Sched."},{"key":"12_CR14","unstructured":"Golovin, D.: Max-min fair allocation of indivisible goods. Technical report, CMU-CS-05-144, Carnegie Mellon University (2005)"},{"key":"12_CR15","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. Elsevier, Amsterdam (2004)"},{"key":"12_CR16","unstructured":"Khodamoradi, K., Krishnamurti, R., Rafiey, A., Stamoulis, G.: PTAS for ordered instances of resource allocation problems. In: Proceedings of the 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013. LIPICS, vol. 24, pp. 461\u2013473 (2013)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-32241-9_9","volume-title":"Computing and Combinatorics","author":"M Mastrolilli","year":"2012","unstructured":"Mastrolilli, M., Stamoulis, G.: Restricted max-min fair allocations with inclusion-free intervals. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 98\u2013108. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32241-9_9"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/ijoc.1090.0355","volume":"22","author":"A Muritiba","year":"2010","unstructured":"Muritiba, A., Iori, M., Malaguti, E., Toth, P.: Algorithms for the bin packing problem with conflicts. INFORMS J. Comput. 22(3), 401\u2013415 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1515\/ausi-2015-0004","volume":"6","author":"D P\u00e1lv\u00f6lgi","year":"2014","unstructured":"P\u00e1lv\u00f6lgi, D.: Partitioning to three matchings of given size is NP-complete for bipartite graphs. Acta Univ. Sapientiae Informatica 6(2), 206\u2013209 (2014)","journal-title":"Acta Univ. Sapientiae Informatica"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13(2), 233\u2013249 (2009)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"12_CR21","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1007\/s10878-016-0035-7","volume":"33","author":"U Pferschy","year":"2017","unstructured":"Pferschy, U., Schauer, J.: Approximation of knapsack problems with conflict and forcing graphs. J. Comb. Optim. 33(4), 1300\u20131323 (2017)","journal-title":"J. Comb. Optim."},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"de Werra, D.: Packing independent sets and transversals. In: Combinatorics and Graph Theory, Banach Center Publications, vol. 25, pp. 233\u2013240. PWN, Warsaw (1989)","DOI":"10.4064\/-25-1-233-240"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:15:45Z","timestamp":1710256545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}