找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Victims of International Crimes: An Interdisciplinary Discourse; Thorsten Bonacker,Christoph Safferling Book 2013 T.M.C. ASSER PRESS, The

[复制链接]
查看: 23736|回复: 64
发表于 2025-3-21 18:15:45 | 显示全部楼层 |阅读模式
书目名称Victims of International Crimes: An Interdisciplinary Discourse
编辑Thorsten Bonacker,Christoph Safferling
视频video
概述Comprehensive volume on role of victims in transitional justice.Definition of victims.Authored by academics and practitioners.Interdisciplinary Approach.Includes supplementary material:
图书封面Titlebook: Victims of International Crimes: An Interdisciplinary Discourse;  Thorsten Bonacker,Christoph Safferling Book 2013 T.M.C. ASSER PRESS, The
描述In international law victims‘ issues have gained more and more attention over the last decades. In particular in transitional justice processes the victim is being given high priority. It is to be seen in this context that the Rome Statute for the International Criminal Court foresees a rather excessive victim participation concept in criminal prosecution. In this volume issue is taken at first with the definition of victims, and secondly with the role of the victim as a witness and as a participant. Several chapters address this matter with a view to the International Criminal Court (ICC), the Extraordinary Chambers in the Courts of Cambodia (ECCC) and the Trial against Demjanjuk in Germany. In a third part the interests of the victims outside the criminal trial are being discussed. In the final part the role of civil society actors are being tackled. This volume thus gives an overview of the role of victims in transitional justice processes from an interdisciplinary angle, combiningacademic research and practical experience.
出版日期Book 2013
关键词Compensation for victims; Human Rights; International criminal law; Transitional Justice; Victim partici
版次1
doihttps://doi.org/10.1007/978-90-6704-912-2
isbn_softcover978-90-6704-966-5
isbn_ebook978-90-6704-912-2
copyrightT.M.C. ASSER PRESS, The Hague, The Netherlands, and the authors 2013
The information of publication is updating

书目名称Victims of International Crimes: An Interdisciplinary Discourse影响因子(影响力)




书目名称Victims of International Crimes: An Interdisciplinary Discourse影响因子(影响力)学科排名




书目名称Victims of International Crimes: An Interdisciplinary Discourse网络公开度




书目名称Victims of International Crimes: An Interdisciplinary Discourse网络公开度学科排名




书目名称Victims of International Crimes: An Interdisciplinary Discourse被引频次




书目名称Victims of International Crimes: An Interdisciplinary Discourse被引频次学科排名




书目名称Victims of International Crimes: An Interdisciplinary Discourse年度引用




书目名称Victims of International Crimes: An Interdisciplinary Discourse年度引用学科排名




书目名称Victims of International Crimes: An Interdisciplinary Discourse读者反馈




书目名称Victims of International Crimes: An Interdisciplinary Discourse读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:18:26 | 显示全部楼层
发表于 2025-3-22 02:30:34 | 显示全部楼层
Theo van Boveneter that is as general as possible and allows to solve independent set in polynomial-time on graphs where the parameter is bounded. We introduce two new graph width parameters: one-sided maximum induced matching-width (o-mim-width) and neighbor-depth. O-mim-width is a graph parameter that is more g
发表于 2025-3-22 06:32:01 | 显示全部楼层
发表于 2025-3-22 09:28:57 | 显示全部楼层
发表于 2025-3-22 15:07:30 | 显示全部楼层
发表于 2025-3-22 19:32:43 | 显示全部楼层
Susanne Buckley-Zistelaph, using searchers; an edge is clear if it cannot contain the searched entity, contaminated otherwise. The . of a graph . is the smallest number of searchers required to “clear” .. A search strategy is . (.) if no recontamination ever occurs. It is . (.) if the set of clear edges always forms a co
发表于 2025-3-23 00:44:21 | 显示全部楼层
Brigitte Bailer-Galandasor networks as they can be used to model link scheduling problems in such networks. It is well known that both problems are NP-complete, and approximation algorithms for them have been extensively studied under the centralized model of computation. Centralized algorithms, however, are not suitable
发表于 2025-3-23 02:39:39 | 显示全部楼层
发表于 2025-3-23 09:14:39 | 显示全部楼层
Daniela Kravetzunded clique-width. It is known that many hard graph problems have polynomial-time algorithms for graphs of bounded clique-width, however, requiring a given decomposition corresponding to clique-width (.); they remove this requirement by constructing an algorithm that either outputs a rank-decomposi
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 19:23
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表